Kurt Pan 密码周刊 (45)

1Posts & Books

• 从蜜月到决裂——探究尼克·萨博对以太坊的态度转变
• 优化互联网中的半诚实安全多方计算
• ABY和ABY2.0
• Secret-shared Shuffle—秘密共享下的洗牌协议
• TCC2021论文简介-零知识和证明系统
• ZK Hack Puzzle 1 题解：如何伪造BLS签名
• Composability: The Final Piece of The Puzzle
• Introducing plonkit
• Halo and more: exploring incremental verification and SNARKs without pairings
• Why zk-SNARK Is The Future Of Blockchain?
• Axelar Open-Sources Multi-Party Cryptography Libraries
• Introducing the Smart Contract Security Registry
• Multiparty Computation over Z/2^kZ
• 规则即代码：人话解读加密朋克智能合约
• The Security Engineer Handbook

2Videos & Podcasts

• fflonk: a Fast-Fourier inspired verifier efficient version of PlonK
• 《安全归约入门: 起源》郭福春
• Non-Interactive Proofs: How far can we go? by Abhishek Jain
• ZK HACK #3 - Introduction to StarkNet Smart Contracts by Starkware
• Episode 205: Curating JPEGs with JPG

3Projects & Docs

• zk-NFT
• Multi-Protocol SPDZ
• Tofn (t-of-n): a threshold cryptography library in Rust
• StarkNet.js
• ark-circom

4Papers & Conferences

• Server-Aided Continuous Group Key Agreement
• Privacy-preserving Identity Management System
• Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
• Polynomial-time targeted attacks on coin tossing for any number of corruptions
• On the Round Complexity of Black-box Secure MPC
• Concurrent-Secure Two-Party Computation in Two Rounds from Subexponential LWE
• Improving Cryptography Based On Entropoids
• Foundations of Transaction Fee Mechanism Design
• A Practical Forward-Secure DualRing
• On Forging SPHINCS+-Haraka Signatures on a Fault-tolerant Quantum Computer

Average-Case Complexity: From Cryptography to Statistical Learning

• On Breaking Encryption With A Statistical Zero-Knowledge Oracle
• Average-Case Hardness Of CSPs
• ndistinguishability Obfuscation and Learning Problems
• Low-Complexity Cryptography and Simple Hard-to-Learn Functions
• On The Hardness Of Average-Case k-SUM
• A Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness
• Analyzing Average-Case Complexity by Meta-Complexity

RWC 2022 Accepted Talk Proposals

• SnarkPack: Practical SNARK Aggregation
• Make Steganography Great Again — Before It's Too Late
• Zero-Knowledge Middleboxes
• Justifying Standard Parameters in the TLS 1.3 Handshake
• Surviving the FO-calypse: Securing PQC Implementations in Practice
• Making Signal Post-quantum Secure: Post-quantum Asynchronous Deniable Key Exchange from Key Encapsulation and Designated Verifier Signatures
• A threshold ECDSA protocol: its design and implementation
• On the (in)security of ElGamal in OpenPGP
• Standardization of Protocols for Privacy-preserving Measurement
• Threshold Cryptography as a Service

ACM CCS 2021 and Workshops

11.15-11.19

• Individualized Cybersecurity Research Mentoring Workshop (iMentor)
• 20th Workshop on Privacy in the Electronic Society (WPES)
• 2021 Cloud Computing Security Workshop (CCSW)
• 2nd Workshop on CPS&IoT Security and Privacy (CPSIoTSec)
• 9th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC)
• Artificial Intelligence and Security (AISec)
• 8th ACM Workshop on Moving Target Defense (MTD)
• Research on offensive and defensive techniques in the context of Man At The End (MATE) attacks (Checkmate)
• Privacy Preserving Machine Learning (PPML)
• Decentralized Finance and Security (DeFi)
• Additive Manufacturing (3D Printing) Security (AMSec)
• 3rd Workshop on Cyber-Security Arms Race (CYSARM)
• Attacks and Solutions in Hardware Security (ASHES)