Public-Key Cryptography – PKC 2020

Chapter 1 The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier

Chapter 2 Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller Sizes

Chapter 3 MPSign: A Signature from Small-Secret Middle-Product Learning with Errors

Chapter 4 Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control

Chapter 5 Boosting Verifiable Computation on Encrypted Data

Chapter 6 Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512

Chapter 7 Threshold Schemes from Isogeny Assumptions

Chapter 8 Topology-Hiding Computation for Networks with Unknown Delays

Chapter 9 Sublinear-Round Byzantine Agreement Under Corrupt Majority

Chapter 10 Bandwidth-Efficient Threshold EC-DSA

Chapter 11 Blazing Fast OT for Three-Round UC OT Extension

Chapter 12 Going Beyond Dual Execution: MPC for Functions with Efficient Verification

Chapter 13 Mon $$\mathbb {Z}_{2^{k}}$$ a: Fast Maliciously Secure Two Party Computation on $$\mathbb {Z}_{2^{k}}$$

Chapter 14 Generic Authenticated Key Exchange in the Quantum Random Oracle Model

Chapter 15 Threshold Ring Signatures: New Definitions and Post-quantum Security

Chapter 16 Tight and Optimal Reductions for Signatures Based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures

Chapter 17 Faster Cofactorization with ECM Using Mixed Representations

Chapter 18 Improved Classical Cryptanalysis of SIKE in Practice

Chapter 19 A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security Level

Chapter 20 Privacy-Preserving Authenticated Key Exchange and the Case of IKEv2

Chapter 21 Linearly-Homomorphic Signatures and Scalable Mix-Nets