Kurt Pan 密码周刊 (34)

1Papers

• A Simple Post-Quantum Non-Interactive Zero-Knowledge Proof from Garbled Circuits

• https://eprint.iacr.org/2021/1068.pdf

• Djed: A Formally Verified Crypto-Backed Pegged Algorithmic Stablecoin

• https://eprint.iacr.org/2021/1069.pdf

• Act natural!": Having a Private Chat on a Public Blockchain

• https://eprint.iacr.org/2021/1073.pdf

• The security of the code-based signature scheme based on the Stern identification protocol

• https://eprint.iacr.org/2021/1075.pdf

• Hardness of KT Characterizes Parallel Cryptography

• https://eprint.iacr.org/2021/1076.pdf

• MProve+ : Privacy Enhancing Proof of Reserves Protocol for Monero

• https://eprint.iacr.org/2021/1077.pdf

• Reflection, Rewinding, and Coin-Toss in EasyCrypt

• https://eprint.iacr.org/2021/1078.pdf

• The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs

• https://eprint.iacr.org/2021/1079.pdf

• Modular Design of Secure Group Messaging Protocols and the Security of MLS

• https://eprint.iacr.org/2021/1083.pdf

• Studying Bitcoin privacy attacks and their Impact on Bitcoin-based Identity Methods

• https://eprint.iacr.org/2021/1088.pdf

• Towards Accountability in CRS Generation

• https://eprint.iacr.org/2021/1090.pdf

• Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering

• https://eprint.iacr.org/2021/1093.pdf

• The Apple PSI System

• https://www.apple.com/child-safety/pdf/Apple_PSI_System_Security_Protocol_and_Analysis.pdf

• FOCS 2021 Accepted Papers

• On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds
• Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
• SNARGs for Polynomial-Time Computations from LWE
• The supersingular isogeny path and endomorphism ring problems are equivalent
• On Classifying Continuous Constraint Satisfaction problems
• Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise
• Constructive Separations and Their Consequences
• Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms
• Quantum learning algorithms imply circuit lower bounds
• Exponential Separations Between Learning With and Without Quantum Memory
• Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
• Tight Space Complexity of the Coin Problem

• The halo2 Book

• https://zcash.github.io/halo2/index.html

• Substrate 技术资源参考汇总

• NFT 资源工具帖

• 新书介绍 | Personalized Privacy Protection in Big Data

• The Joy of Cryptography

• https://web.engr.oregonstate.edu/~rosulekm/crypto/

• Cryptography Apocalypse

• https://terrorgum.com/tfox/books/cryptographyapocalypse_preparingforthedaywhenquantumcomputingbreakstodayscrypto.pdf

• https://learning.chaincode.com/

• 第五届中国区块链开发大赛

• http://www.cbdforum.cn/bcweb/contest-mat.html

![[Pasted image 20210826180805.png]]

《红楼梦》有很漂亮的结构，这一点和以后我做数学有密切的关系。做数学，不仅仅要解决孤立的问题，而是融合起来，成就一个大结构，从而影响数学长久的发展。

--丘成桐