Monday ====== * Morning --------- - Welcome Index Calculus -------------- - *Best Paper* Cover and Decomposition Index Calculus on Elliptic Curves made practical. Application to a previously unreachable curve over Fp^6 - Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields Symmetric Constructions I ------------------------- - Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading Invited Talk I -------------- - Antoine Joux * Afternoon ----------- Secure Computation ------------------ - Fair Computation with Rational Players - Concurrently Secure Computation in Constant Rounds - Identity-Based Encryption Resilient to Continual Auxiliary Leakage Protocols --------- - Quantum Proofs of Knowledge - On Round-Optimal Zero Knowledge in the Bare Public-Key Model - Robust Coin Flipping - Unconditionally-Secure Robust Secret Sharing with Compact Shares Tuesday ======= * Morning --------- Lossy Trapdoor Functions ------------------------ - All-But-Many Lossy Trapdoor Functions - Identity-Based (Lossy) Trapdoor Functions and Applications - Dual Projective Hashing and its Applications - Lossy Trapdoor Functions and More Tools ----- - Efficient Zero-Knowledge Argument for Correctness of a Shuffle - Malleable Proof Systems and Applications - Group to Group Commitments Do Not Shrink - Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting * Afternoon ----------- Symmetric Constructions II -------------------------- - Minimalism in Cryptography: The Even-Mansour Scheme Revisited - Message Authentication, Revisited - Property Preserving Symmetric Encryption Symmetric Cryptanalysis ----------------------- - Narrow Bicliques: Cryptanalysis of Full IDEA - Cryptanalyses on a Merkle-Damgard Based MAC --- Almost Universal Forgery and Distinguishing-H Attacks - Statistical Tools Flavor Side-Channel Collision Attacks Wednesday ========= * Morning --------- Fully Homomorphic Encryption ---------------------------- - Public-key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers - FHE with Polylog Overhead - Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE Asymmetric Cryptanalysis ------------------------ - Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers - Decoding Random Binary Linear Codes in 2^(n/20): How 1+1=0 Improves Information Set Decoding Invited Talk II --------------- - Alfred Menezes * Afternoon ----------- Efficient Reductions -------------------- - Optimal Security Proofs for Full Domain Hash, Revisited - On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model - Tightly-Secure Signatures from Lossy ID Schemes Public-Key Schemes ------------------ - Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption - Scalable Group Signatures with Revocation - Incremental Deterministic Public-Key Encryption Thursday ======== * Morning --------- Security Models --------------- - Standard Security Does Not Imply Security Against Selective-Opening - Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security - Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation Lattices -------- - Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller - Pseudorandom Functions and Lattices - Lattice Signatures Without Trapdoors