Publications of eurocrypt 2012

Page	Title
1-7	A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract)
8	Another Look at Provable Security
9-26	Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over $F_(p^6)$
27-44	Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
45-62	Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract)
63-80	Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
81-98	Fair Computation with Rational Players
99-116	Concurrently Secure Computation in Constant Rounds
117-134	Identity-Based Encryption Resilient to Continual Auxiliary Leakage
135-152	Quantum Proofs of Knowledge
153-171	On Round-Optimal Zero Knowledge in the Bare Public-Key Model
172-194	Robust Coin Flipping
195-208	Unconditionally-Secure Robust Secret Sharing with Compact Shares
209-227	All-But-Many Lossy Trapdoor Functions
228-245	Identity-Based (Lossy) Trapdoor Functions and Applications
246-262	Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More
263-280	Efficient Zero-Knowledge Argument for Correctness of a Shuffle
281-300	Malleable Proof Systems and Applications
301-317	Group to Group Commitments Do Not Shrink
318-335	Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
336-354	Minimalism in Cryptography: The Even-Mansour Scheme Revisited
355-374	Message Authentication, Revisited
375-391	Property Preserving Symmetric Encryption
392-410	Narrow-Bicliques: Cryptanalysis of Full IDEA
411-427	Cryptanalyses on a Merkle-Damgård Based MAC - Almost Universal Forgery and Distinguishing-H Attacks
428-445	Statistical Tools Flavor Side-Channel Collision Attacks
446-464	Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
465-482	Fully Homomorphic Encryption with Polylog Overhead
483-501	Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
502-519	Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
520-536	Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
537-553	Optimal Security Proofs for Full Domain Hash, Revisited
554-571	On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
572-590	Tightly-Secure Signatures from Lossy Identification Schemes
591-608	Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
609-627	Scalable Group Signatures with Revocation
628-644	Incremental Deterministic Public-Key Encryption
645-662	Standard Security Does Not Imply Security against Selective-Opening
663-681	Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
682-699	Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation
700-718	Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
719-737	Pseudorandom Functions and Lattices
738-755	Lattice Signatures without Trapdoors