Kurt Pan 密码周刊 (28)
1Papers
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
https://eprint.iacr.org/2021/913.pdf Principal Component Analysis using CKKS Homomorphic Encryption Scheme
https://eprint.iacr.org/2021/914.pdf A PCP Theorem for Interactive Proofs
https://eprint.iacr.org/2021/915.pdf Mithril: Stake-based Threshold Multisignatures
https://eprint.iacr.org/2021/916.pdf The Round Complexity of Quantum Zero-Knowledge
https://eprint.iacr.org/2021/918.pdf The supersingular isogeny path and endomorphism ring problems are equivalent
https://eprint.iacr.org/2021/919.pdf Non-malleable Commitments against Quantum Attacks
https://eprint.iacr.org/2021/920.pdf Semilinear transformations in coding theory and their application to cryptography
https://eprint.iacr.org/2021/921.pdf Provably Secure Short Signature Scheme from Isogeny between Elliptic Curves
https://eprint.iacr.org/2021/922.pdf On the (in)security of ElGamal in OpenPGP
https://eprint.iacr.org/2021/923.pdf On Removing Rejection Conditions in Practical Lattice-Based Signatures
https://eprint.iacr.org/2021/924.pdf Bilinear Map Based One-Time Signature Scheme with Secret Key Exposure
https://eprint.iacr.org/2021/925.pdf On Treewidth, Separators and Yao's Garbling
https://eprint.iacr.org/2021/926.pdf A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs
https://eprint.iacr.org/2021/927.pdf Darlin: A proof carrying data scheme based on Marlin
https://eprint.iacr.org/2021/930.pdf Succinct Functional Commitment for a Large Class of Arithmetic Circuits
https://eprint.iacr.org/2021/932.pdf Fast Factoring Integers by SVP Algorithms, corrected
https://eprint.iacr.org/2021/933.pdf ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines
https://eprint.iacr.org/2021/934.pdf ROTed: Random Oblivious Transfer for embedded devices
https://eprint.iacr.org/2021/935.pdf Compact Ring Signatures from Learning With Errors
https://eprint.iacr.org/2021/942.pdf Breaking the Circuit-Size Barrier for Secure Computation under Quasi-Polynomial LPN
https://eprint.iacr.org/2021/943.pdf Limits on the Adaptive Security of Yao's Garbling
https://eprint.iacr.org/2021/945.pdf Hidden Cosets and Applications to Unclonable Cryptography
https://eprint.iacr.org/2021/946.pdf
| Posts |
|---|
| DFINITY 生态项目大起底 |
| 互联网计算机共识协议介绍 |
| L2 - 理解和思考 |
| GK15-Ring Signature |
| 数学中的一朵“奇葩”——四元数 |
| Lumino仪式技术解析——椭圆曲线 |
| 长文解读新一代PlatON DID |
| Information Security Group Review 20/21 |
| Enforcing encryption at scale |
| From AIRs to RAPs - how PLONK-style arithmetization works |
| Thinking like a cryptographer (in the 20th century) |
| ECDSA两方签名 III |
| 为什么区块链需要Web3.0 |
| 什么是 Drivechain？ |
| 如何利用虚拟通道来创建状态通道网络 |
Cryptographic Migration & Agility
https://cspub.h-da.io/cma/ 2021 IACR Fellows
https://iacr.org/fellows/2021/ PQC 2021
https://pqcrypto2021.kr/program.php July 20 - July 22 The Impact of Post Quantum Cryptography on UEFI BIOS
https://www.brighttalk.com/webcast/18206/498403 Jul 27
往期周刊回顾：
为了方便电脑用户，以及更开放的互联网访问，周刊内容会同步发布在Gitbook。
点击【阅读原文】👇可访问