default search action
38th CRYPTO 2018: Santa Barbara, CA, USA - Part II
- Hovav Shacham, Alexandra Boldyreva:
Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II. Lecture Notes in Computer Science 10992, Springer 2018, ISBN 978-3-319-96880-3
Proof Tools
- Phillip Rogaway, Yusi Zhang:
Simplifying Game-Based Definitions - Indistinguishability up to Correctness and Its Application to Stateful AE. 3-32 - Georg Fuchsbauer, Eike Kiltz
, Julian Loss:
The Algebraic Group Model and its Applications. 33-62
Key Exchange
- Julia Hesse, Dennis Hofheinz, Lisa Kohl:
On Tightly Secure Non-Interactive Key Exchange. 65-94 - Kristian Gjøsteen, Tibor Jager:
Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange. 95-125
Symmetric Cryptoanalysis
- Yosuke Todo
Fast Correlation Attack Revisited - Cryptanalysis on Full Grain-128a, Grain-128, and Grain-v1. 129-159 - Ximing Fu
A Key-Recovery Attack on 855-round Trivium. 160-184 - Achiya Bar-On, Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir:
Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities. 185-212 - Mridul Nandi
Bernstein Bound on WCS is Tight - Repairing Luykx-Preneel Optimal Forgeries. 213-238
Hashes and Random Oracles
- Alexander Russell
Correcting Subverted Random Oracles. 241-271 - Balthazar Bauer, Pooya Farshim, Sogol Mazaheri:
Combiners for Backdoored Random Oracles. 272-302 - Ilan Komargodski, Eylon Yogev:
On Distributional Collision Resistant Hashing. 303-327
Trapdoor Functions
- Tore Kasper Frederiksen, Yehuda Lindell
Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries. 331-361 - Sanjam Garg, Mohammad Hajiabadi:
Trapdoor Functions from the Computational Diffie-Hellman Assumption. 362-391
Round Optimal MPC
- Prabhanjan Ananth, Arka Rai Choudhuri
Round-Optimal Secure Multiparty Computation with Honest Majority. 395-424 - Arpita Patra, Divya Ravi
On the Exact Round Complexity of Secure Three-Party Computation. 425-458 - Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Promise Zero Knowledge and Its Applications to Round Optimal MPC. 459-487 - Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Secure Multi-Party Computation. 488-520
Foundations
- Kasper Green Larsen, Jesper Buus Nielsen:
Yes, There is an Oblivious RAM Lower Bound! 523-542 - Nuttapong Attrapadung, Takahiro Matsuda, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa:
Constrained PRFs for \mathrmNC^1 in Traditional Groups. 543-574
Lattices
- Yilei Chen, Vinod Vaikuntanathan, Hoeteck Wee:
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates. 577-607 - Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata:
Lower Bounds on Lattice Enumeration with Extreme Pruning. 608-637 - Andre Esser
Dissection-BKW. 638-666
Lattice-Based ZK
- Carsten Baum, Jonathan Bootle
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. 669-699 - Benoît Libert, San Ling
Lattice-Based Zero-Knowledge Arguments for Integer Relations. 700-732 - Sam Kim, David J. Wu:
Multi-Theorem Preprocessing NIZKs from Lattices. 733-765
Efficient MPC
- Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing:
SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. 769-798 - Ivan Damgård, Claudio Orlandi
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. 799-829
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-11-13 23:35 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: