default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40th CRYPTO 2020: Santa Barbara, CA, USA - Part III
- Daniele Micciancio
, Thomas Ristenpart:
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III. Lecture Notes in Computer Science 12172, Springer 2020, ISBN 978-3-030-56876-4
Multi-party Computation
- Peihan Miao, Sarvar Patel, Mariana Raykova, Karn Seth, Moti Yung:
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality. 3-33 - Melissa Chase, Peihan Miao:
Private Set Intersection in the Internet Setting from Lightweight Oblivious PRF. 34-63 - Megan Chen, Ran Cohen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, Abhi Shelat:
Multiparty Generation of an RSA Modulus. 64-93
Secret Sharing
- Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-malleability Against Polynomial Tampering. 97-126 - Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi:
Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model. 127-155 - Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries. 156-185
Cryptanalysis
- Nicholas Carlini, Matthew Jagielski, Ilya Mironov:
Cryptanalytic Extraction of Neural Network Models. 189-218 - Fukang Liu, Takanori Isobe, Willi Meier:
Automatic Verification of Differential Characteristics: Application to Reduced Gimli. 219-248 - Thomas Peyrin, Haoyang Wang:
The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers. 249-278 - Jintai Ding, Joshua Deaton, Kurt Schmidt, Vishakha, Zheng Zhang:
Cryptanalysis of the Lifted Unbalanced Oil Vinegar Signature Scheme. 279-298 - Tim Beyne, Anne Canteaut, Itai Dinur, Maria Eichlseder, Gregor Leander, Gaëtan Leurent, María Naya-Plasencia, Léo Perrin, Yu Sasaki, Yosuke Todo, Friedrich Wiemer:
Out of Oddity - New Cryptanalytic Techniques Against Symmetric Primitives Optimized for Integrity Proof Systems. 299-328 - Christof Beierle, Gregor Leander, Yosuke Todo:
Improved Differential-Linear Attacks with Applications to ARX Ciphers. 329-358 - Patrick Derbez, Paul Huynh, Virginie Lallemand, María Naya-Plasencia, Léo Perrin, André Schrottenloher:
Cryptanalysis Results on Spook - Bringing Full-Round Shadow-512 to the Light. 359-388 - Daniel Apon, Ray A. Perlner, Angela Robinson, Paolo Santini:
Cryptanalysis of LEDAcrypt. 389-418 - Christof Beierle, Alex Biryukov, Luan Cardoso dos Santos, Johann Großschädl, Léo Perrin, Aleksei Udovenko, Vesselin Velichkov, Qingju Wang:
Alzette: A 64-Bit ARX-box - (Feat. CRAX and TRAX). 419-448
Delay Functions
- Mahimna Kelkar, Fan Zhang, Steven Goldfeder, Ari Juels:
Order-Fairness for Byzantine Consensus. 451-480 - Lior Rotem, Gil Segev:
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. 481-509
Zero Knowledge
- Thomas Attema, Ronald Cramer:
Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. 513-543 - Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. 544-573 - Liran Katzir, Clara Shikhelman, Eylon Yogev:
Interactive Proofs for Social Graphs. 574-601 - Jelle Don, Serge Fehr, Christian Majenz:
The Measure-and-Reprogram Technique 2.0: Multi-round Fiat-Shamir and More. 602-631 - Alex Lombardi, Vinod Vaikuntanathan:
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs. 632-651 - Yael Tauman Kalai, Omer Paneth, Lisa Yang:
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness. 652-673 - Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni:
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust. 674-703 - Srinath T. V. Setty:
Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. 704-737 - Zvika Brakerski, Venkata Koppula, Tamer Mour:
NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations. 738-767 - Geoffroy Couteau, Dominik Hartmann:
Shorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages. 768-798 - Andrea Coladangelo, Thomas Vidick, Tina Zhang:
Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing. 799-828
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 2024-10-02 20:48 CEST 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:
