default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDASIACRYPT 2011: Seoul, South Korea
- Dong Hoon Lee, Xiaoyun Wang:
Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings. Lecture Notes in Computer Science 7073, Springer 2011, ISBN 978-3-642-25384-3
Lattices and Quantum Cryptography
- Yuanmi Chen, Phong Q. Nguyen:
BKZ 2.0: Better Lattice Security Estimates. 1-20 - Shweta Agrawal, David Mandell Freeman
, Vinod Vaikuntanathan:
Functional Encryption for Inner Product Predicates from Learning with Errors. 21-40 - Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry:
Random Oracles in a Quantum World. 41-69
Public Key Encryption I
- Brett Hemenway, Benoît Libert, Rafail Ostrovsky, Damien Vergnaud:
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. 70-88 - Jan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, Vincent Naessens:
Structure Preserving CCA Secure Encryption and Applications. 89-106 - Alexander May, Alexander Meurer, Enrico Thomae:
Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$. 107-124 - Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi:
Lower and Upper Bounds for Deniable Public-Key Encryption. 125-142
Public Key Encryption II
- Qianhong Wu, Bo Qin, Lei Zhang, Josep Domingo-Ferrer, Oriol Farràs:
Bridging Broadcast Encryption and Group Key Agreement. 143-160 - Kenneth G. Paterson, Jacob C. N. Schuldt, Martijn Stam, Susan Thomson:
On the Joint Security of Encryption and Signature, Revisited. 161-178 - Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Ludovic Perret:
Polly Cracker, Revisited. 179-196
Database Privacy
- Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li:
Oblivious RAM with O((logN)3) Worst-Case Cost. 197-214 - Raghav Bhaskar, Abhishek Bhowmick, Vipul Goyal, Srivatsan Laxman, Abhradeep Thakurta:
Noiseless Database Privacy. 215-232
Hash Function
- Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger:
The Preimage Security of Double-Block-Length Compression Functions. 233-251 - María Naya-Plasencia, Deniz Toz, Kerem Varici:
Rebound Attack on JH42. 252-269 - Alex Biryukov, Mario Lamberger, Florian Mendel, Ivica Nikolic:
Second-Order Differential Collisions for Reduced SHA-256. 270-287 - Florian Mendel, Tomislav Nad, Martin Schläffer:
Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions. 288-307
Symmetric Key Encryption
- Mohamed Ahmed Abdelraheem, Céline Blondeau, María Naya-Plasencia, Marion Videau, Erik Zenner:
Cryptanalysis of ARMADILLO2. 308-326 - Itai Dinur, Tim Güneysu, Christof Paar, Adi Shamir, Ralf Zimmermann:
An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware. 327-343 - Andrey Bogdanov, Dmitry Khovratovich, Christian Rechberger:
Biclique Cryptanalysis of the Full AES. 344-371 - Kenneth G. Paterson, Thomas Ristenpart, Thomas Shrimpton:
Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol. 372-389
Zero Knowledge Proof
- Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, Amit Sahai, Moti Yung:
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge. 390-406 - Claude Crépeau, Louis Salvail, Jean-Raymond Simard, Alain Tapp:
Two Provers in Isolation. 407-430 - Jens Groth:
Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments. 431-448
Universal Composability
- Jan Camenisch, Stephan Krenn, Victor Shoup:
A Framework for Practical Universally Composable Zero-Knowledge Protocols. 449-467 - Marc Fischlin, Benoît Libert, Mark Manulis:
Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security. 468-485
Foundation
- Mihir Bellare, David Cash, Rachel Miller:
Cryptography Secure against Related-Key Attacks and Tampering. 486-503 - Pierrick Gaudry, David R. Kohel, Benjamin A. Smith:
Counting Points on Genus 2 Curves with Real Multiplication. 504-519 - Samuel Ranellucci, Alain Tapp, Severin Winkler, Jürg Wullschleger:
On the Efficiency of Bit Commitment Reductions. 520-537 - Qiushi Yang, Yvo Desmedt:
Secure Communication in Multicast Graphs. 538-555
Secure Computation and Secret Sharing
- Jonathan Katz, Lior Malka:
Constant-Round Private Function Evaluation with Linear Complexity. 556-571 - Chao Ning, Qiuliang Xu:
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security. 572-589 - Michael Backes, Aniket Kate, Arpita Patra:
Computational Verifiable Secret Sharing Revisited. 590-609 - Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. 610-627
Public Key Signature
- Masayuki Abe, Jens Groth, Miyako Ohkubo:
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions. 628-646 - Dennis Hofheinz, Tibor Jager, Eike Kiltz:
Short Signatures from Weaker Assumptions. 647-666 - Charles Bouillaguet, Pierre-Alain Fouque, Gilles Macario-Rat:
Practical Key-Recovery for All Possible Parameters of SFLASH. 667-685
Leakage Resilient Cryptography
- Divesh Aggarwal, Ueli Maurer:
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy. 686-701 - Stefan Dziembowski, Sebastian Faust:
Leakage-Resilient Cryptography from the Inner-Product Extractor. 702-721 - Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. 722-739 - Seung Geol Choi, Aggelos Kiayias, Tal Malkin:
BiTR: Built-in Tamper Resilience. 740-758
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:26 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:
