default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd CRYPTO 2012: Santa Barbara, California, USA
- Reihaneh Safavi-Naini, Ran Canetti:
Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings. Lecture Notes in Computer Science 7417, Springer 2012, ISBN 978-3-642-32008-8 - Viet Tung Hoang, Ben Morris, Phillip Rogaway:
An Enciphering Scheme Based on a Card Shuffle. 1-13 - Will Landecker, Thomas Shrimpton, R. Seth Terashima:
Tweakable Blockciphers with Beyond Birthday-Bound Security. 14-30 - Tetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu:
Breaking and Repairing GCM Security Proofs. 31-49 - Mohamed Ahmed Abdelraheem, Martin Ågren, Peter Beelen
, Gregor Leander:
On the Distribution of Linear Biases: Three Instructive Examples. 50-67 - Eric Miles, Emanuele Viola:
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. 68-85 - Jonathan Zittrain:
The End of Crypto. 86 - Mike Rosulek:
Must You Know the Code of f to Securely Compute f? 87-104 - Sanjam Garg, Amit Sahai:
Adaptively Secure Multi-Party Computation with Dishonest Majority. 105-123 - Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas:
Collusion-Preserving Computation. 124-143 - Amos Beimel, Oriol Farràs, Yuval Mintz:
Secret Sharing Schemes for Very Dense Graphs. 144-161 - Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption with Bounded Collusions via Multi-party Computation. 162-179 - Allison B. Lewko, Brent Waters:
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques. 180-198 - Amit Sahai, Hakan Seyalioglu, Brent Waters:
Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption. 199-217 - Brent Waters:
Functional Encryption for Regular Languages. 218-235 - Melissa Chase, Ivan Visconti:
Secure Database Commitments and Universal Arguments of Quasi Knowledge. 236-254 - Nir Bitansky, Alessandro Chiesa:
Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. 255-272 - Tibor Jager, Florian Kohlar, Sven Schäge, Jörg Schwenk:
On the Security of TLS-DHE in the Standard Model. 273-293 - Mihir Bellare, Stefano Tessaro, Alexander Vardy:
Semantic Security for the Wiretap Channel. 294-311 - Mihir Bellare, Thomas Ristenpart, Stefano Tessaro:
Multi-instance Security and Its Application to Password-Based Cryptography. 312-329 - Bart Mennink, Bart Preneel:
Hash Functions Based on Three Permutations: A Generic Security Analysis. 330-347 - Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro:
To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC. 348-366 - Simon Knellwolf, Dmitry Khovratovich:
New Preimage Attacks against Reduced SHA-1. 367-383 - John P. Steinberger, Xiaoming Sun, Zhe Yang:
Stam's Conjecture and Threshold Phenomena in Collision Resistance. 384-405 - Mike Rosulek:
Universal Composability from Essentially Any Trusted Setup. 406-423 - Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti:
Impossibility Results for Static Input Secure Computation. 424-442 - Shweta Agrawal, Vipul Goyal, Abhishek Jain, Manoj Prabhakaran, Amit Sahai:
New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation. 443-460 - Huijia Lin, Rafael Pass:
Black-Box Constructions of Composable Protocols without Set-Up. 461-478 - Johannes Gehrke, Michael Hay, Edward Lui, Rafael Pass:
Crowd-Blending Privacy. 479-496 - Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan:
Differential Privacy with Imperfect Randomness. 497-516 - Feng-Hao Liu, Anna Lysyanskaya:
Tamper and Leakage Resilience in the Split-State Model. 517-532 - Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits against Constant-Rate Tampering. 533-551 - Guy N. Rothblum:
How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware. 552-569 - Ernie Brickell:
Recent Advances and Existing Research Questions in Platform Security. 570 - Benoît Libert, Thomas Peters, Moti Yung:
Group Signatures with Almost-for-Free Revocation. 571-589 - Dennis Hofheinz, Tibor Jager:
Tightly Secure Signatures and Public-Key Encryption. 590-607 - Romain Bardou, Riccardo Focardi, Yusuke Kawamoto, Lorenzo Simionato, Graham Steel, Joe-Kai Tsay:
Efficient Padding Oracle Attacks on Cryptographic Hardware. 608-625 - Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter:
Public Keys. 626-642 - Ivan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias:
Multiparty Computation from Somewhat Homomorphic Encryption. 643-662 - Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky:
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. 663-680 - Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra:
A New Approach to Practical Active-Secure Two-Party Computation. 681-700 - Mohammad Mahmoody, Rafael Pass:
The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives. 701-718 - Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir:
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems. 719-740 - Aslí Bay, Atefeh Mashatan, Serge Vaudenay:
Resistance against Iterated Attacks by Decorrelation Revisited, . 741-757 - Mark Zhandry:
Secure Identity-Based Encryption in the Quantum Random Oracle Model. 758-775 - Mario Berta, Omar Fawzi, Stephanie Wehner:
Quantum to Classical Randomness Extractors. 776-793 - Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail:
Actively Secure Two-Party Evaluation of Any Quantum Operation. 794-811 - Goichiro Hanaoka, Takahiro Matsuda, Jacob C. N. Schuldt:
On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups. 812-831 - Alexandre Duc, Dimitar Jetchev:
Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves. 832-849 - Craig Gentry, Shai Halevi, Nigel P. Smart:
Homomorphic Evaluation of the AES Circuit. 850-867 - Zvika Brakerski:
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. 868-886
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-04 22:05 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:
