default search action
38th CRYPTO 2018: Santa Barbara, CA, USA - Part III
- Hovav Shacham, Alexandra Boldyreva:
Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part III. Lecture Notes in Computer Science 10993, Springer 2018, ISBN 978-3-319-96877-3
Efficient MPC
- Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
TinyKeys: A New Approach to Efficient Multi-Party Computation. 3-33 - Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. 34-64
Quantum Cryptography
- Zvika Brakerski:
Quantum FHE (Almost) As Secure As Classical. 67-95 - Haodong Jiang, Zhenfeng Zhang, Long Chen, Hong Wang, Zhi Ma:
IND-CCA-Secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited. 96-125 - Zhengfeng Ji, Yi-Kai Liu, Fang Song:
Pseudorandom Quantum States. 126-152 - Alice Pellet-Mary:
Quantum Attacks Against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map Model. 153-183 - Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee:
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem. 184-210
MPC
- Itai Dinur, Nathan Keller, Ohad Klein:
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing. 213-242 - Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? 243-272 - Sanjam Garg, Peihan Miao, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. 273-301 - Elette Boyle, Yuval Ishai, Antigoni Polychroniadou:
Limits of Practical Sublinear Secure Computation. 302-332
Garbling
- Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ameer Mohammed:
Limits on the Power of Garbling Techniques for Public-Key Encryption. 335-364 - Jonathan Katz, Samuel Ranellucci, Mike Rosulek, Xiao Wang:
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. 365-391
Information-Theoretic MPC
- Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan:
Amortized Complexity of Information-Theoretically Secure MPC Revisited. 395-426 - Prabhanjan Ananth, Yuval Ishai, Amit Sahai:
Private Circuits: A Modular Approach. 427-455
Various Topics
- Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha:
A New Public-Key Cryptosystem via Mersenne Numbers. 459-482 - Florian Bourse, Michele Minelli, Matthias Minihold, Pascal Paillier:
Fast Homomorphic Evaluation of Deep Discretized Neural Networks. 483-512
Oblivious Transfer
- Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. 515-544 - Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler:
On the Round Complexity of OT Extension. 545-574
Non-malleable Codes
- Aggelos Kiayias, Feng-Hao Liu, Yiannis Tselekounis:
Non-Malleable Codes for Partial Functions with Manipulation Detection. 577-607 - Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti:
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions. 608-639
Zero Knowledge
- Shashank Agrawal, Chaya Ganesh, Payman Mohassel:
Non-Interactive Zero-Knowledge Proofs for Composite Statements. 643-673 - Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. 674-697 - Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers:
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs. 698-728
Obfuscation
- Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi:
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards. 731-752 - Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On the Complexity of Compressing Obfuscation. 753-783
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.