Kurt Pan 密码周刊 (24)
Papers
Lower bounds on lattice sieving and information set decoding
https://eprint.iacr.org/2021/785.pdf Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P
https://eprint.iacr.org/2021/788.pdf Transforming Secure Comparison Protocol from Passive to Active Adversary Model
https://eprint.iacr.org/2021/795.pdf How Byzantine is a Send Corruption?
https://eprint.iacr.org/2021/796.pdf LLVM-based Circuit Compilation for Practical Secure Computation
https://eprint.iacr.org/2021/797.pdf Probabilistic Dynamic Input Output Automata
https://eprint.iacr.org/2021/798.pdf Lattice Attacks on NTRU and LWE: A History of Refinements
https://eprint.iacr.org/2021/799.pdf TEMP: Time-locked Encryption Made Practical
https://eprint.iacr.org/2021/800.pdf Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes
https://eprint.iacr.org/2021/801.pdf On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing
https://eprint.iacr.org/2021/802.pdf On the Privacy of Protocols based on CPA-Secure Homomorphic Encryption
https://eprint.iacr.org/2021/803.pdf Practical Settlement Bounds for Proof-of-Work Blockchains
https://eprint.iacr.org/2021/805.pdf Boosting the Security of Blind Signature Schemes
https://eprint.iacr.org/2021/806.pdf Non-Interactive Batch Arguments for NP from Standard Assumptions
https://eprint.iacr.org/2021/807.pdf SNARGs for from LWE
https://eprint.iacr.org/2021/808.pdf SoK: Efficient Privacy-preserving Clustering
https://eprint.iacr.org/2021/809.pdf Efficient Asynchronous Byzantine Agreement without Private Setups
https://eprint.iacr.org/2021/810.pdf A General Purpose Transpiler for Fully Homomorphic Encryption
https://eprint.iacr.org/2021/811.pdf Intelligent Composed Algorithms
https://eprint.iacr.org/2021/813.pdf A New Way to Achieve Round-Efficient Byzantine Agreement
https://eprint.iacr.org/2021/814.pdf CTng: Secure Certificate and Revocation Transparency
https://eprint.iacr.org/2021/818.pdf On the hardness of the NTRU problem
https://eprint.iacr.org/2021/821.pdf One-out-of- OT Combiners
https://eprint.iacr.org/2021/822.pdf Security Characterization of J-PAKE and its Variants
https://eprint.iacr.org/2021/824.pdf OpenSSLNTRU: Faster post-quantum TLS key exchange
https://eprint.iacr.org/2021/826.pdf http://acm-stoc.org/stoc2021/STOCprogram.html
| Posts & Videos |
|---|
| But what is a Fourier series? From heat flow to drawing with circles |
| But what is the Fourier Transform? A visual introduction. |
| Report on The Eurocrypt 2021 Review Process |
| The more general uncertainty principle, beyond quantum |
| 我为什么反对Taproot |
| 读懂比特币协议重要里程碑：Schnorr 签名和 Taproot 软分叉升级 |
| Schnorr Signature Series |
| 以太坊 “伦敦” 升级预览 |
| Mike Rosulek 课程系列: 混淆电路及其优化(三) |
| 零知识证明系列专题（十三）：基于short IOP的简洁零知识证明 III |
| 谷歌开源首个通用全同态加密转译器 |
| Rollup 学习笔记 |
| 创世文档：Hal Finney 的数字现金探索成果 RPOW |
| 威腾：我像发现生命意义却苦于无法言诠的人 |
| Composability is Innovation |
| How the Coming Privacy Layer Will Fix the Broken Web |
| Edward Snowden: Lifting the mask On liberty, on privacy, on Substack |
A Pragmatic Introduction to Secure Multi-Party Computation
https://github.com/google/fully-homomorphic-encryption
https://github.com/arkworks-rs/algebra
2021 Fudan Logic Summer School
http://logic.fudan.edu.cn/event2021/summer Lattices: Algorithms, Complexity, and Cryptography Reunion
https://simons.berkeley.edu/workshops/lattices-algorithms-complexity-and-cryptography-reunion Quantum Wave in Computing Reunion
https://simons.berkeley.edu/workshops/quantum-wave-in-computing-reunion
对手的所为所图，魔苟斯知之甚详，并已针对他们的进攻时刻安排了计划应对。
-《胡林的子女》
往期周刊回顾：
为了方便电脑用户，以及更开放的互联网访问，周刊内容会同步发布在Gitbook。
点击【阅读原文】👇可访问