Kurt Pan 密码周刊 (29)
1Papers
One-Time Delegation of Unlinkable Signing Rights and Its Application
https://eprint.iacr.org/2020/1603.pdf Speeding-up Ideal Lattice-Based Key Exchange Using a RSA/ECC Coprocessor
https://eprint.iacr.org/2020/1602.pdf Cryptographic competitions
https://eprint.iacr.org/2020/1608.pdf Lockable Signatures for Blockchains: Scriptless Scripts for All Signatures
https://eprint.iacr.org/2020/1613.pdf SoK: Algorithmic Incentive Manipulation Attacks on Permissionless PoW Cryptocurrencies
https://eprint.iacr.org/2020/1614.pdf Arguments of Knowledge via hidden order groups
https://eprint.iacr.org/2020/1617.pdf Proof-Carrying Data without Succinct Arguments
https://eprint.iacr.org/2020/1618.pdf Getting Rid of Linear Algebra in Number Theory Problems
https://eprint.iacr.org/2020/1619.pdf Scabbard: a suite of efficient learning with rounding key-encapsulation mechanisms
https://eprint.iacr.org/2021/954.pdf Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
https://eprint.iacr.org/2021/957.pdf Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes
https://eprint.iacr.org/2021/961.pdf Post-Quantum Key-Blinding for Authentication in Anonymity Networks
https://eprint.iacr.org/2021/963.pdf Secure Quantum Computation with Classical Communication
https://eprint.iacr.org/2021/964.pdf Assessment of Quantum Threat To Bitcoin and Derived Cryptocurrencies
https://eprint.iacr.org/2021/967.pdf White-Box Implementations for Hash-Based Signatures and One-Time Passwords
https://eprint.iacr.org/2021/968.pdf Short Identity-Based Signatures with Tight Security from Lattices
https://eprint.iacr.org/2021/970.pdf Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for -Protocols
https://eprint.iacr.org/2021/971.pdf Partial Key Exposure Attack on Short Secret Exponent CRT-RSA
https://eprint.iacr.org/2021/972.pdf A Multiplatform Parallel Approach for Lattice Sieving Algorithms
https://eprint.iacr.org/2021/973.pdf Bridges connecting Encryption Schemes
https://eprint.iacr.org/2021/975.pdf Reinventing BEDs: Formal Treatment of Broadcast Encryption with Dealership and Practical Constructions
https://eprint.iacr.org/2021/976.pdf Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices
https://eprint.iacr.org/2021/977.pdf Constant-Overhead Zero-Knowledge for RAM Programs
https://eprint.iacr.org/2021/979.pdf Binary Field Montgomery Multiplication on Quantum Computers
https://eprint.iacr.org/2021/980.pdf
PQC 21
Invited Talk: The Homestretch: the beginning of the end of the NIST PQC 3rd Round Invited Talk: Intractability Assumptions on Module Lattices Secure Hybrid Encryption In the Standard Model from Hard Learning Problems On Removing Rejection Conditions in Practical Lattice-Based Signatures Short Identity-Based Signatures with Tight Security from Lattices Zero-Knowledge Proofs for Committed Symmetric Boolean Functions Generating Cryptographically-Strong Random Lattice Bases and Recognizing Rotations of Z^n CSI-RAShi: Distributed Key Generation for CSIDH SimS: a Simplification of SiGamal Memory Optimization Techniques for Computing Discrete Logarithms in Compressed SIKE Quantum Key Search for Ternary LWE A Fusion Algorithm for Solving the Hidden Shift Problem in Finite Abelian Groups The "Quantum Annoying" Property of Password-Authenticated Key Exchange Protocols Implementation of Lattice Trapdoors on Modules and Applications Verifying Post-Quantum Signatures in 8 kB of RAM Quantum Indistinguishability for Public Key Encryption
| Posts |
|---|
| 丘成桐：数学为基础科学之基础 |
| 入门须引路 功夫法自修——王元院士谈数学教学 |
| zkSync：要扩展，不要安全降级 |
| 数学家证明相变的对称性：从旋转对称性到标度不变性 |
| 数学从根本玩的是概念，而不是技巧 |
| New Shape Opens ‘Wormhole’ Between Numbers and Geometry |
| How Many Numbers Exist? Infinity Proof Moves Math Closer to an Answer |
| The Sum-Check Protocol |
| 计算机理论顶会STOC 2021奖项出炉，滕尚华等华人学者获奖 |
| Interactive Aggregate Signatures from Lattices |
| ECDSA多方签名 |
| A Prehistory of DAOs |
| Membership proofs from polynomial commitments |
| Retroactive Public Goods Funding |
| Enumerating k-SAT functions |
| Evaluating a Mina staking pool’s performance |
| Cryptanalysis of Meow Hash |
| Honeywell and Cambridge Quantum Reach New Milestones |
| “追溯性公共产品募资”机制 |
| Four cryptographic vulnerabilities in Telegram |
| Subtractive Sets Over Cyclotomic Rings |
| GoogleCTF Quals 2021 Crypto Writeups |
| Google CTF 2021 - Crypto |
| Videos |
|---|
| ZKStudyClub - Sumcheck Arguments and Their Applications |
| The Standard Model: The Most Successful Scientific Theory Ever |
| Until the Sun Engulfs the Earth: Lower Bounds in Computational Complexity |
| The Why & How of Privacy for DAOs |
Quantum-Steampunk: The physics of yesterday's tomorrow
https://quantumsteampunk.umiacs.io/book/ Computational complexity for physicists
https://www.gemmadelascuevas.com/some-material/ Quantum Wave in Computing Reunion
https://www.youtube.com/playlist?list=PLgKuh-lKre12IREk5ghQZbNGXNPoHEG30 Cryptimeleon - prototyping for advanced privacy-preserving constructions
https://cryptimeleon.org/ The Future of Quantum Machine Learning
https://www.youtube.com/watch?v=5UsJV2BNj2U Friday, July 23 @ 2PM EDT Google Quantum Summer Symposium 2021
https://events.withgoogle.com/2021-quantum-summer-symposium/schedule/#content
一个城市真正的“里子”，不是所谓“城市良心”下水管道，而是如何以最低成本实现最大程度的安全。
往期周刊回顾：
为了方便电脑用户，以及更开放的互联网访问，周刊内容会同步发布在Gitbook。
点击【阅读原文】👇可访问