ASIACRYPT 2011: Seoul, South Korea
Dong Hoon Lee, Xiaoyun Wang (Eds.): 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. Springer 2011 Lecture Notes in Computer Science ISBN 978-3-642-25384-3
Lattices and Quantum Cryptography
- 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
- 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
- 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
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
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team