default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID34th CRYPTO 2014: Santa Barbara, California, USA
- Juan A. Garay, Rosario Gennaro:
Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II. Lecture Notes in Computer Science 8617, Springer 2014, ISBN 978-3-662-44380-4
Quantum Cryptography
- Dominique Unruh
:
Quantum Position Verification in the Random Oracle Model. 1-18 - Yi-Kai Liu:
Single-Shot Security for One-Time Memories in the Isolated Qubits Model. 19-36
Foundations of Hardness
- Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs. 37-54 - Periklis A. Papakonstantinou, Guang Yang:
Cryptography with Streaming Algorithms. 55-70
Obfuscation II
- Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen:
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. 71-89 - Takashi Yamakawa, Shota Yamada, Goichiro Hanaoka, Noboru Kunihiro:
Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications. 90-107 - Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. 108-125
Number-Theoretic Hardness
- Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F24 1223 and F212 367). 126-145
Side Channels and Leakage Resilience II
- Nir Bitansky, Dana Dachman-Soled, Huijia Lin:
Leakage-Tolerant Computation with Input-Independent Preprocessing. 146-163 - Prabhanjan Ananth, Vipul Goyal, Omkant Pandey:
Interactive Proofs under Continual Memory Leakage. 164-182
Information-Theoretic Security
- Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin:
Amplifying Privacy in Privacy Amplification. 183-198 - Deepesh Data, Manoj Prabhakaran, Vinod M. Prabhakaran:
On the Communication Complexity of Secure Computation. 199-216 - Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
Optimal Non-perfect Uniform Secret Sharing Schemes. 217-234
Key Exchange and Secure Communication
- Karthikeyan Bhargavan, Cédric Fournet, Markulf Kohlweiss, Alfredo Pironti, Pierre-Yves Strub, Santiago Zanella Béguelin:
Proving the TLS Handshake Secure (As It Is). 235-255 - Jan Camenisch, Anja Lehmann, Anna Lysyanskaya, Gregory Neven:
Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment. 256-275
Zero Knowledge
- Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Scalable Zero Knowledge via Cycles of Elliptic Curves. 276-294 - Charanjit S. Jutla, Arnab Roy:
Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces. 295-312 - Ben Fisch, Daniel Freund, Moni Naor:
Physical Zero-Knowledge Proofs of Physical Properties. 313-336
Composable Security
- Ran Canetti, Abhishek Jain, Omer Paneth:
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. 337-350 - Susumu Kiyoshima:
Round-Efficient Black-Box Construction of Composable Multi-Party Computation. 351-368
Secure Computation - Foundations
- Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas:
Secure Multi-Party Computation with Identifiable Abort. 369-386 - Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. 387-404 - Dana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schröder:
Feasibility and Infeasibility of Secure Computation with Malicious PUFs. 405-420 - Iddo Bentov, Ranjit Kumaresan:
How to Use Bitcoin to Design Fair Protocols. 421-439
Secure Computation - Implementations
- Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek:
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR. 440-457 - Yan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, Alex J. Malozemoff:
Amortizing Garbled Circuits. 458-475 - Yehuda Lindell, Ben Riva:
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings. 476-494 - Enrique Larraia, Emmanuela Orsini, Nigel P. Smart:
Dishonest Majority Multi-Party Computation for Binary Circuits. 495-512 - Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, Vassilis Zikas:
Efficient Three-Party Computation from Cut-and-Choose. 513-530
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-09-18 00:23 CEST 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:
