default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th CRYPTO 2015: Santa Barbara, California, USA
- Rosario Gennaro, Matthew Robshaw:
Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9216, Springer 2015, ISBN 978-3-662-47999-5
Multiparty Computation I
- Ran Canetti, Asaf Cohen, Yehuda Lindell
:
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. 3-22 - Vipul Goyal, Divya Gupta, Amit Sahai:
Concurrent Secure Computation via Non-Black Box Simulation. 23-42 - Ran Canetti, Vipul Goyal, Abhishek Jain:
Concurrent Secure Computation with Optimal Query Complexity. 43-62 - S. Dov Gordon, Feng-Hao Liu, Elaine Shi:
Constant-Round MPC with Fairness and Guarantee of Output Delivery. 63-82
Zero-Knowledge
- Susumu Kiyoshima:
Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions. 85-106 - Fabrice Benhamouda, Geoffroy Couteau, David Pointcheval, Hoeteck Wee:
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting. 107-129 - Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Impossibility of Black-Box Simulation Against Leakage Attacks. 130-149 - Zhangxiang Hu, Payman Mohassel, Mike Rosulek:
Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost. 150-169
Theory
- Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel:
Parallel Hashing via List Recoverability. 173-190 - Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with One-Way Communication. 191-208 - Yu Yu, Dawu Gu, Xiangxue Li, Jian Weng:
(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond. 209-229
Signatures
- Georg Fuchsbauer, Christian Hanser, Daniel Slamanig:
Practical Round-Optimal Blind Signatures in the Standard Model. 233-253 - Dario Catalano, Dario Fiore, Luca Nizzardo:
Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys. 254-274 - Eike Kiltz, Jiaxin Pan, Hoeteck Wee:
Structure-Preserving Signatures from Standard Assumptions, Revisited. 275-295 - Benoît Libert, Thomas Peters, Moti Yung:
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions. 296-316
Multiparty Computation II
- Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai:
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ. 319-338 - Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro:
Round-Optimal Black-Box Two-Party Computation. 339-358 - Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz, Anat Paskin-Cherniavsky:
Secure Computation with Minimal Interaction, Revisited. 359-378 - Marcin Andrychowicz, Stefan Dziembowski:
PoW-Based Distributed Cryptography with No Trusted Setup. 379-399
Non-Signaling and Information-Theoretic Crypto
- Serge Fehr, Max Fillinger:
Multi-prover Commitments Against Non-signaling Attacks. 403-421 - Yael Tauman Kalai, Ron D. Rothblum:
Arguments of Proximity - [Extended Abstract]. 422-442 - Eric Chitambar, Benjamin Fortescue, Min-Hsiu Hsieh:
Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information. 443-462 - Yevgeniy Dodis, Yanqing Yao:
Privacy with Imperfect Randomness. 463-482
Attribute-Based Encryption
- Romain Gay, Iordanis Kerenidis, Hoeteck Wee:
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. 485-502 - Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Predicate Encryption for Circuits from LWE. 503-523 - Lucas Kowalczyk, Allison Bishop Lewko:
Bilinear Entropy Expansion from the Decisional Linear Assumption. 524-541
New Primitives
- Marc Fischlin, Felix Günther, Giorgia Azzurra Marson, Kenneth G. Paterson:
Data Is a Stream: Security of Stream-Based Channels. 545-564 - Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. 565-584 - Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, Krzysztof Pietrzak:
Proofs of Space. 585-605
Fully Homomorphic/Functional Encryption
- Anne Broadbent, Stacey Jeffery:
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity. 609-629 - Michael Clear, Ciaran McGoldrick:
Multi-identity and Multi-key Leveled FHE from Learning with Errors. 630-656 - Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan:
From Selective to Adaptive Security in Functional Encryption. 657-677 - Brent Waters:
A Punctured Programming Approach to Adaptively Secure Functional Encryption. 678-697
Multiparty Computation III
- Divya Gupta, Yuval Ishai, Hemanta K. Maji, Amit Sahai:
Secure Computation from Leaky Correlated Randomness. 701-720 - Daniel Genkin, Yuval Ishai, Antigoni Polychroniadou:
Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits. 721-741 - Elette Boyle, Kai-Min Chung, Rafael Pass:
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs. 742-762 - Joël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, Vassilis Zikas:
Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting. 763-780
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-12-05 22:21 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:
