PKC 2020

54 talks · 2020 · indexed by Breach Arc Archive. Links open each talk on YouTube.

• A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials 2020
• A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security Level 2020
• Adaptive Simulation Security for Inner Product Functional Encryption 2020
• Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More 2020
• Bandwidth-Efficient Threshold EC-DSA 2020
• Blazing Fast OT for Three-Round UC OT Extension 2020
• Boosting Verifiable Computation on Encrypted Data 2020
• Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes 2020
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to ... 2020
• Constraining and Watermarking PRFs from Milder Assumptions 2020
• Efficient Redactable Signature and Application to Anonymous Credentials 2020
• Fast, Compact, and Expressive Attribute-Based Encryption 2020
• Faster Cofactorization with ECM Using Mixed Representations 2020
• Flexible Authenticated and Confidential Channel Establishment (fACCE): Analyzing the Noise Prot... 2020
• Generic Authenticated Key Exchange in the Quantum Random Oracle Model 2020
• Going Beyond Dual Execution: MPC for Functions with Efficient Verification 2020
• Hierarchical Identity-Based Encryption with Tight Multi-challenge Security 2020
• Improved Classical Cryptanalysis of SIKE in Practice 2020
• Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography 2020
• Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange 2020
• Linearly-Homomorphic Signatures and Scalable Mix-Nets 2020
• Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512 2020
• Master-Key KDM-Secure IBE from Pairings 2020
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms 2020
• Mon$$\mathbb {Z}_{2^{k}}$$a: Fast Maliciously Secure Two Party Computation on $$\mathbb {Z}_{2^... 2020
• MPSign: A Signature from Small-Secret Middle-Product Learning with Errors 2020
• On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly fr... 2020
• On QA-NIZK in the BPK Model 2020
• PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Stan... 2020
• Privacy-Preserving Authenticated Key Exchange and the Case of IKEv2 2020
• Public-Key Puncturable Encryption: Modular and Compact Constructions 2020
• s-148 Welcome + Functional Encryption and Identity Based Encryption 2020
• s-154 Encryption Schemes and Secure Channels 2020
• s-158 Invited Talk 2020
• s-161 Proofs and Arguments 2020
• s-167 Multiparty Protocols, Secure Computation and Related Primitives 2020
• s-169 PKC Test of Time Award Ceremony 2020
• s-170 Post Quantum Cryptography 2020
• s-185 Cryptographic Primitives 2020
• s-187 Lattice Based Cryptography 2020
• s-189 Cryptanalysis and Concrete Security + Closing Remarks 2020
• Sublinear-Round Byzantine Agreement Under Corrupt Majority 2020
• The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier 2020
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO 2020
• Threshold Ring Signatures: New Definitions and Post-quantum Security 2020
• Threshold Schemes from Isogeny Assumptions 2020
• Tight and Optimal Reductions for Signatures Based on Average Trapdoor Preimage Sampleable Funct... 2020
• Topology-Hiding Computation for Networks with Unknown Delays 2020
• Toward RSA-OAEP Without Random Oracles 2020
• Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Small... 2020
• Updateable Inner Product Argument with Logarithmic Verifier and Applications 2020
• Verifiable Inner Product Encryption Scheme 2020
• Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control 2020
• Witness Maps and Applications 2020