International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference

Page	Title
1-20	Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back)
21-40	Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
41-58	Protecting Cryptographic Keys against Continual Leakage
59-79	Securing Computation against Continuous Leakage
80-97	An Efficient and Parallel Gaussian Sampler for Lattices
98-115	Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
116-137	Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
138-154	Additively Homomorphic Encryption with d-Operand Multiplications
155-172	i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
173-190	Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
191-208	Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
209-236	Structure-Preserving Signatures and Commitments to Group Elements
237-254	Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
255-276	Credential Authenticated Identification and Key Exchange
277-294	Password-Authenticated Session-Key Generation on the Internet in the Plain Model
295-313	Instantiability of RSA-OAEP under Chosen-Plaintext Attack
314-332	Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
333-350	Factorization of a 768-Bit RSA Modulus
351-369	Correcting Errors in RSA Private Keys
370-392	Improved Differential Attacks for ECHO and Grøstl
393-410	A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony
411-428	Universally Composable Incoercibility
429-446	Concurrent Non-Malleable Zero Knowledge Proofs
447-464	Equivalence of Uniform Key Agreement and Composition Insecurity
465-482	Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
483-501	Improved Delegation of Computation Using Fully Homomorphic Encryption
502-519	Oblivious RAM Revisited
520-537	On Strong Simulation and Composable Point Obfuscation
538-557	Protocols for Multiparty Coin Toss with Dishonest Majority
558-576	Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
577-594	Secure Multiparty Computation with Minimal Interaction
595-612	A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
613-630	On Generalized Feistel Networks
631-648	Cryptographic Extraction and Key Derivation: The HKDF Scheme
649-665	Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
666-684	Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
685-706	Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
707-723	On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
724-741	Sampling in a Quantum Population, and Applications