International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques

Preface and frontmatter

Page	Title
1-11	Security Analysis of the Strong Diffie-Hellman Problem
12-29	Cryptography in Theory and Practice: The Case of Encryption in IPsec
30-47	Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
48-58	Alien vs. Quine, the Vanishing Circuit and Other Tales from the Industry's Crypt
59-72	Hiding Secret Points Amidst Chaff
73-87	Parallel and Concurrent Security of the HB and HB⁺ Protocols
88-108	Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
109-128	QUAD: A Practical Stream Cipher with Provable Security
129-146	How to Strengthen Pseudo-random Generators by Using Compression
147-164	Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
165-182	VSH, an Efficient and Provable Collision-Resistant Hash Function
183-200	Herding Hash Functions and the Nostradamus Attack
201-221	Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
222-232	Oblivious Transfer Is Symmetric
233-253	Symplectic Lattice Reduction and NTRU
254-270	The Function Field Sieve in the Medium Prime Case
271-288	Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
289-307	The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
308-327	Private Circuits II: Keeping Secrets in Tamperable Circuits
328-338	Composition Implies Adaptive Security in Minicrypt
339-358	Perfect Non-interactive Zero Knowledge for NP
359-372	Language Modeling and Encryption on Packet Switched Networks
373-390	A Provable-Security Treatment of the Key-Wrap Problem
391-408	Luby-Rackoff Ciphers from Weak Round Functions?
409-426	The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
427-444	Compact Group Signatures Without Random Oracles
445-464	Practical Identity-Based Encryption Without Random Oracles
465-485	Sequential Aggregate Signatures and Multisignatures Without Random Oracles
486-503	Our Data, Ourselves: Privacy Via Distributed Noise Generation
504-521	On the (Im-)Possibility of Extending Coin Toss
522-537	Efficient Binary Conversion for Paillier Encrypted Values
538-554	Information-Theoretic Conditions for Two-Party Secure Function Evaluation
555-572	Unclonable Group Identification
573-592	Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
593-611	Simplified Threshold RSA with Adaptive and Proactive Security