default search action
EUROCRYPT 2015: Sofia, Bulgaria
- Elisabeth Oswald, Marc Fischlin:
Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9057, Springer 2015, ISBN 978-3-662-46802-9
Signatures
- Susan Hohenberger, Venkata Koppula, Brent Waters:
Universal Signature Aggregators. 3-34 - Masayuki Abe, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi:
Fully Structure-Preserving Signatures and Shrinking Commitments. 35-65
Zero-Knowledge Proofs
- Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Disjunctions for Hash Proof Systems: New Constructions and Applications. 69-100 - Eike Kiltz, Hoeteck Wee:
Quasi-Adaptive NIZK for Linear Subspaces Revisited. 101-128
Leakage-Resilient Cryptography
- Dana Dachman-Soled, Feng-Hao Liu, Hong-Sheng Zhou:
Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components Without Leak-Free Hardware. 131-158 - Stefan Dziembowski, Sebastian Faust, Maciej Skorski:
Noisy Leakage Revisited. 159-188
Garbled Circuits
- Tore Kasper Frederiksen, Jesper Buus Nielsen, Claudio Orlandi:
Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge. 191-219 - Samee Zahur, Mike Rosulek, David Evans:
Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. 220-250
Crypto Currencies
- Jens Groth, Markulf Kohlweiss:
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin. 253-280 - Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol: Analysis and Applications. 281-310
Secret Sharing
- Ronald Cramer, Ivan Bjerre Damgård, Nico Döttling, Serge Fehr, Gabriele Spini:
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. 313-336 - Elette Boyle, Niv Gilboa, Yuval Ishai:
Function Secret Sharing. 337-367
Outsourcing Computations
- Alessandro Chiesa, Eran Tromer, Madars Virza:
Cluster Computing in Zero Knowledge. 371-403 - Dan Boneh, Divya Gupta, Ilya Mironov, Amit Sahai:
Hosting Services on an Untrusted Cloud. 404-436
Obfuscation and E-Voting
- Joe Zimmerman:
How to Obfuscate Programs Directly. 439-467 - Aggelos Kiayias, Thomas Zacharias, Bingsheng Zhang:
End-to-End Verifiable Elections in the Standard Model. 468-498
Multi-party Computations
- Shashank Agrawal, Shweta Agrawal, Manoj Prabhakaran:
Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data. 501-531 - Melissa Chase, Rafail Ostrovsky, Ivan Visconti:
Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World. 532-560
Encryption
- Dan Boneh, Kevin Lewi, Mariana Raykova, Amit Sahai, Mark Zhandry, Joe Zimmerman:
Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation. 563-594 - Jie Chen, Romain Gay, Hoeteck Wee:
Improved Dual System ABE in Prime-Order Groups via Predicate Encodings. 595-624
Resistant Protocols
- Mihir Bellare, Viet Tung Hoang:
Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model. 627-656 - Ilya Mironov, Noah Stephens-Davidowitz:
Cryptographic Reverse Firewalls. 657-686
Key Exchange
- Gilles Barthe, Juan Manuel Crespo, Yassine Lakhnech, Benedikt Schmidt:
Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols. 689-718 - Jiang Zhang, Zhenfeng Zhang, Jintai Ding, Michael Snook, Özgür Dagdelen:
Authenticated Key Exchange from Ideal Lattices. 719-751
Quantum Cryptography
- Dominique Unruh:
Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model. 755-784 - Yi-Kai Liu:
Privacy Amplification in the Isolated Qubits Model. 785-814
Discrete Logarithms
- Aaram Yun:
Generic Hardness of the Multiple Discrete Logarithm Problem. 817-836
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.