default search action
23rd PKC 2020: Edinburgh, UK
- Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, Vassilis Zikas:
Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12111, Springer 2020, ISBN 978-3-030-45387-9
Lattice-Based Cryptography
- Léo Ducas, Thijs Laarhoven
, Wessel P. J. van Woerden:
The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier. 3-36 - Jiang Zhang, Yu Yu, Shuqin Fan, Zhenfeng Zhang, Kang Yang:
Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller Sizes. 37-65 - Shi Bai, Dipayan Das, Ryo Hiromasa, Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Zhenfei Zhang:
MPSign: A Signature from Small-Secret Middle-Product Learning with Errors. 66-93
Proofs and Arguments II
- Zvika Brakerski, Yael Kalai:
Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control. 97-123 - Dario Fiore, Anca Nitulescu, David Pointcheval:
Boosting Verifiable Computation on Encrypted Data. 124-154
Isogeny-Based Cryptography
- Ali El Kaafarani, Shuichi Katsumata, Federico Pintore
Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512. 157-186 - Luca De Feo
Threshold Schemes from Isogeny Assumptions. 187-212
Multiparty Protocols
- Rio LaVigne, Chen-Da Liu Zhang
Topology-Hiding Computation for Networks with Unknown Delays. 215-245 - T.-H. Hubert Chan, Rafael Pass
Sublinear-Round Byzantine Agreement Under Corrupt Majority. 246-265 - Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, Ida Tucker
Bandwidth-Efficient Threshold EC-DSA. 266-296
Secure Computation and Related Primitives
- Ran Canetti, Pratik Sarkar, Xiao Wang
Blazing Fast OT for Three-Round UC OT Extension. 299-327 - Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam:
Going Beyond Dual Execution: MPC for Functions with Efficient Verification. 328-356 - Dario Catalano, Mario Di Raimondo, Dario Fiore, Irene Giacomelli:
Mon$\mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $\mathbb {Z}_{2^{k}}$. 357-386
Post-Quantum Primitives
- Kathrin Hövelmanns
Generic Authenticated Key Exchange in the Quantum Random Oracle Model. 389-422 - Abida Haque, Alessandra Scafuro:
Threshold Ring Signatures: New Definitions and Post-quantum Security. 423-452 - André Chailloux, Thomas Debris-Alazard:
Tight and Optimal Reductions for Signatures Based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures. 453-479
Cryptanalysis and Concrete Security
- Cyril Bouvier, Laurent Imbert:
Faster Cofactorization with ECM Using Mixed Representations. 483-504 - Craig Costello
Improved Classical Cryptanalysis of SIKE in Practice. 505-534 - Aurore Guillevic
A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security Level. 535-564
Privacy-Preserving Schemes
- Sven Schäge
Privacy-Preserving Authenticated Key Exchange and the Case of IKEv2. 567-596 - Chloé Hébant
Linearly-Homomorphic Signatures and Scalable Mix-Nets. 597-627 - Olivier Sanders:
Efficient Redactable Signature and Application to Anonymous Credentials. 628-656
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-08 00:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: