Kurt Pan 密码周刊 (10)
Papers
On the (In)Security of the Diffie-Hellman Oblivious PRF with Multiplicative Blinding: https://eprint.iacr.org/2021/273.pdf
Large Message Homomorphic Secret Sharing from DCR and Applications: https://eprint.iacr.org/2021/274.pdf
On the Integer Polynomial Learning with Errors Problem
polynomial-time average-case reductions for the search variant of I-PLWE , proving its computational equivalence with the search variant of its counterpart problem PLWE/employ a careful adaptation of Rényi divergence analysis techniques to bound the impact of the integer ring arithmetic carries on the error distributions/present a deterministic publickey cryptosystem over integer rings https://eprint.iacr.org/2021/277.pdf More Communication Lower Bounds for Information-Theoretic MPC: https://eprint.iacr.org/2021/278.pdf
Online-Extractability in the Quantum Random-Oracle Model: https://eprint.iacr.org/2021/280.pdf
Subquadratic SNARGs in the Random Oracle Model
a new construction that achieves a smaller sub-quadratic argument size of Micali's SNARG construction https://eprint.iacr.org/2021/281.pdf One-way functions and malleability oracles: Hidden shift attacks on isogeny-based protocols: https://eprint.iacr.org/2021/282.pdf
The Eye of Horus: Spotting and Analyzing Attacks on Ethereum Smart Contracts: https://eprint.iacr.org/2021/284.pdf
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge)
shows how to instantiate Fiat-Shamir for parallel repetitions of much more general interactive proofs. https://eprint.iacr.org/2021/286.pdf A Deeper Look at Machine Learning-Based Cryptanalysis: https://eprint.iacr.org/2021/287.pdf
Redeeming Reset Indifferentiability and Post-Quantum Groups
Under weak reset indifferentiability, ideal ciphers imply (fixed size) random oracles and random oracle domain shrinkage is possible./ideal ciphers imply random oracles under quantum indifferentiability./ generic groups are still meaningful quantumly, showing that they are quantumly (reset) indifferentiable from ideal ciphers/cryptographic groups yield post-quantum symmetric key cryptography./obtain a plausible post-quantum random oracle that is a subset-product followed by two modular reductions. https://eprint.iacr.org/2021/288.pdf Bandwidth-efficient threshold EC-DSA revisited: Online/Offline Extensions, Identifiable Aborts Proactive and Adaptive Security
use the class group based CL framework so as to drastically reduce bandwidth consumption/ e present a new, maliciously secure, full threshold ECDSA protocol that achieving additional features without sacrificing efficiency https://eprint.iacr.org/2021/291.pdf Code-based signatures without trapdoors through restricted vectors
propose a new adaptation of the Schnorr-Lyubashevsky framework to codes in the Hamming metric exploiting restricted vectors, which allows avoiding existing attacks https://eprint.iacr.org/2021/294.pdf HashWires: Hyperefficient Credential-Based Range Proofs: https://eprint.iacr.org/2021/297.pdf
On extensions of the one-time-pad: https://eprint.iacr.org/2021/298.pdf
The More The Merrier: Reducing the Cost of Large Scale MPC: https://eprint.iacr.org/2021/303.pdf
Epoque: Practical End-to-End Verifiable Post-Quantum-Secure E-Voting: https://eprint.iacr.org/2021/304.pdf
SoK: Game-based Security Models for Group Key Exchange: https://eprint.iacr.org/2021/305.pdf
Round-Optimal Blind Signatures in the Plain Model from Classical and Quantum Standard Assumptions: https://eprint.iacr.org/2021/306.pdf
A Compressed Σ-Protocol Theory for Lattices
show a lattice-based solution for commit-and-prove transparent circuit zero-knowledge (ZK) with polylog-communication, the first not depending on PCPs https://eprint.iacr.org/2021/307.pdf Threshold Garbled Circuits and Ad Hoc Secure Computation: https://eprint.iacr.org/2021/308.pdf
4 new iO constructions，2 in STOC21/ 2 in Eurocrypt21 https://eprint.iacr.org/2020/764 https://eprint.iacr.org/2020/1003 https://eprint.iacr.org/2020/1010 https://eprint.iacr.org/2020/1042
Posts & Videos
| Title | Link |
|---|---|
| Star Li: 年终总结 - 2020，机遇 | https://mp.weixin.qq.com/s/eYV4gCrk3cWaIAZrhymgmw |
| Zero-Knowledge Proofs from Information-Theoretic Proof Systems - Part I | https://zkproof.org/2020/08/12/information-theoretic-proof-systems/ |
| Zero-Knowledge Proofs from Information-Theoretic Proof Systems - Part II | https://zkproof.org/2020/10/15/information-theoretic-proof-systems-part-ii/ |
| Playing with Randomness and Interactions to Prove Theorems | https://zkproof.org/2020/10/15/randomness-and-interactions/ |
| What is Huffman Coding? | https://www.baseclass.io/huffman-coding/ |
| 隐私计算实验室:我们的论文被密码学顶级会议Eurocrypt 2021收录 | https://mp.weixin.qq.com/s/yrG6AE9XQLCZCF2xqOWKog |
| 喜讯:零知识证明的高速架构 上海树图区块链研究院参与的论文被国际顶会ISCA收录 | https://mp.weixin.qq.com/s/7XMX1uH4LDNdXaA7qHN8eA |
| The Latest News about Post-Quantum Cryptography | https://www.youtube.com/watch?v=fNkNYi3a4Zc |
| Can Quantum Computers Hack Bitcoin?!? | https://www.youtube.com/watch?v=IaoTtkuY7jM |
| New Algorithm Breaks Speed Limit for Solving Linear Equations | https://www.quantamagazine.org/new-algorithm-breaks-speed-limit-for-solving-linear-equations-20210308/ |
| A Crash Course on MPC, Part 8 | https://medium.com/applied-mpc/a-crash-course-on-mpc-part-8-363374202e6 |
Resources & Events
MIP*=RE 介绍 FLSeminar
3月11日（周四）晚上18:30，南京大学喻良教授讲座：MIP*=RE 介绍。地点：光华楼西辅楼402室。 https://mp.weixin.qq.com/s/3ej6Z_Ery4L26GVIpQH26w PQSHIELD White Paper Series: https://pqshield.com/quantum-threat
Confidence in Post Quantum Algorithms: https://cloudsecurityalliance.org/artifacts/confidence-in-post-quantum-algorithms/
https://zkproof.org/blog/
S&P 22 Call For Papers: https://www.ieee-security.org/TC/SP2022/cfpapers.html
ESORICS 2021: Call for papers: https://esorics2021.athene-center.de/call-for-papers.php
往期周刊回顾：
为了方便电脑用户，以及更开放的互联网访问，周刊内容会同步发布在Gitbook。
点击【阅读原文】👇可访问