default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEUROCRYPT 2016: Vienna, Austria
- Marc Fischlin, Jean-Sébastien Coron:
Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II. Lecture Notes in Computer Science 9666, Springer 2016, ISBN 978-3-662-49895-8 - Benoît Libert, San Ling
, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors. 1-31 - Shota Yamada:
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters. 32-62 - Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Online/Offline OR Composition of Sigma Protocols. 63-92 - Susumu Kiyoshima:
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance. 93-123 - Apoorvaa Deshpande, Venkata Koppula, Brent Waters:
Constrained Pseudorandom Functions for Unconstrained Inputs. 124-153 - Yu Yu, John P. Steinberger:
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN. 154-183 - Dakshita Khurana, Hemanta K. Maji, Amit Sahai:
Secure Computation from Elastic Noisy Channels. 184-212 - Dakshita Khurana, Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai:
All Complete Functionalities are Reversible. 213-242 - Mohammad Mahmoody, Ameer Mohammed:
On the Power of Hierarchical Identity-Based Encryption. 243-272 - Christoph Bader, Tibor Jager, Yong Li, Sven Schäge:
On the Impossibility of Tight Cryptographic Reductions. 273-304 - Jens Groth:
On the Size of Pairing-Based Non-interactive Arguments. 305-326 - Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit:
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting. 327-357 - Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro:
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. 358-387 - Ryo Nishimaki, Daniel Wichs, Mark Zhandry:
Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key. 388-419 - Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén:
Unconditionally Secure Computation with Reduced Interaction. 420-447 - Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou:
The Exact Round Complexity of Secure Computation. 448-476 - Serge Fehr, Max Fillinger:
On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments. 477-496 - Dominique Unruh:
Computationally Binding Quantum Commitments. 497-527 - Nicolas Gama, Malika Izabachène, Phong Q. Nguyen, Xiang Xie:
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems. 528-558 - Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev:
Recovering Short Generators of Principal Ideals in Cyclotomic Rings. 559-585 - Marcin Andrychowicz, Stefan Dziembowski, Sebastian Faust:
Circuit Compilers with O(1/\log (n)) Leakage Rate. 586-615 - Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud:
Randomness Complexity of Private Circuits for Multiplication. 616-648 - Dana Dachman-Soled, Jonathan Katz, Aishwarya Thiruvengadam:
10-Round Feistel is Indifferentiable from an Ideal Cipher. 649-678 - Yevgeniy Dodis, Martijn Stam, John P. Steinberger, Tianren Liu:
Indifferentiability of Confusion-Diffusion Networks. 679-704 - Aggelos Kiayias, Hong-Sheng Zhou, Vassilis Zikas:
Fair and Robust Multi-party Computation Using a Global Transaction Ledger. 705-734 - Pratyay Mukherjee, Daniel Wichs:
Two Round Multiparty Computation via Multi-key FHE. 735-763 - Saikrishna Badrinarayanan, Eric Miles, Amit Sahai, Mark Zhandry:
Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits. 764-791 - Mihir Bellare, Igors Stepanovs, Brent Waters:
New Negative Results on Differing-Inputs Obfuscation. 792-821 - Miguel Ambrona, Gilles Barthe, Benedikt Schmidt:
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model. 822-851 - Zvika Brakerski, Ilan Komargodski, Gil Segev:
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. 852-880 - Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. 881-908
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 2026-01-29 23:09 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:
