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

Front Matter....Pages -
BKZ 2.0: Better Lattice Security Estimates....Pages 1-20
Functional Encryption for Inner Product Predicates from Learning with Errors....Pages 21-40
Random Oracles in a Quantum World....Pages 41-69
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security....Pages 70-88
Structure Preserving CCA Secure Encryption and Applications....Pages 89-106
Decoding Random Linear Codes in $\\tilde{\\mathcal{O}}(2^{0.054n})$ ....Pages 107-124
Lower and Upper Bounds for Deniable Public-Key Encryption....Pages 125-142
Bridging Broadcast Encryption and Group Key Agreement....Pages 143-160
On the Joint Security of Encryption and Signature, Revisited....Pages 161-178
Polly Cracker, Revisited....Pages 179-196
Oblivious RAM with O ((log N ) 3 ) Worst-Case Cost....Pages 197-214
Noiseless Database Privacy....Pages 215-232
The Preimage Security of Double-Block-Length Compression Functions....Pages 233-251
Rebound Attack on JH42....Pages 252-269
Second-Order Differential Collisions for Reduced SHA-256....Pages 270-287
Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions....Pages 288-307
Cryptanalysis of ARMADILLO2....Pages 308-326
An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware....Pages 327-343
Biclique Cryptanalysis of the Full AES....Pages 344-371
Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol....Pages 372-389
Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge....Pages 390-406
Two Provers in Isolation....Pages 407-430
Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments....Pages 431-448
A Framework for Practical Universally Composable Zero-Knowledge Protocols....Pages 449-467
Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security....Pages 468-485
Cryptography Secure against Related-Key Attacks and Tampering....Pages 486-503
Counting Points on Genus 2 Curves with Real Multiplication....Pages 504-519
On the Efficiency of Bit Commitment Reductions....Pages 520-537
Secure Communication in Multicast Graphs....Pages 538-555
Constant-Round Private Function Evaluation with Linear Complexity....Pages 556-571
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security....Pages 572-589
Computational Verifiable Secret Sharing Revisited....Pages 590-609
Natural Generalizations of Threshold Secret Sharing....Pages 610-627
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions....Pages 628-646
Short Signatures from Weaker Assumptions....Pages 647-666
Practical Key-Recovery for All Possible Parameters of SFLASH....Pages 667-685
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy....Pages 686-701
Leakage-Resilient Cryptography from the Inner-Product Extractor....Pages 702-721
Program Obfuscation with Leaky Hardware....Pages 722-739
BiTR: Built-in Tamper Resilience....Pages 740-758
Back Matter....Pages -