Ya nos podemos descargar las presentaciones de la conferencia Crypto 2011 celebrada en Santa Barbara, California los pasados 14 al 18 de agosto.
Leftover Hash Lemma, Revisited [slides] Random Oracle Reducibility [slides] Time-Lock Puzzles in the Random Oracle Model [slides] Physically Uncloneable Functions in the Universal Composition Framework [slides] Computer-Aided Security Proofs for the Working Cryptographer [slides] Illegitimi Non Carborundum [slides] Optimal Verification of Operations on Dynamic Sets [slides] Verificable Delegation of Computation over Large Datasets [slides] Secure Computation on the Web: Computing Without Simultaneous Interaction [slides] Memory Delegation [slides] Automatic Search of Attacks on Round-Reduced AES and Applications [slides] How to Improve Rebound Attacks [slides] A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack [slides] The PHOTON Family of Lightweight Hash Functions [slides] Perfectly-Secure Multiplication for any t n/3 [slides] The IPS Compiler: Optimizations, Variants and Concrete Efficiency [slides] 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds [slides] Leakage-Resilient Zero Knowledge [slides] A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework [slides] Key-Evolution Schemes Resilient to Space-Bounded Leakage [slides] Generic Side-Channel Distinguishers: Improvements and Limitations [slides] Cryptography with Tamperable and Leaky Memory [slides] Tutorial Session — Fully Homomorphic Encryption, by Shai Halevi [slides] Merkle Puzzles in a Quantum World Classical Cryptographic Protocols in a Quantum World [slides] Position-Based Quantum Cryptography: Impossibility and Constructions [slides] Analyzing Blockwise Lattice Algorithms using Dynamical Systems [slides] Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions [slides] Tor and Circumvention: Lessons Learned [slides] Fully Homomorphic Encryption over the Integers with Shorter Public-Keys [slides] Fully Homomorphic Encryption for Ring-LWE and Security for Key Dependent Messages [slides] Bi-Deniable Public-Key Encryption [slides] Better Security for Deterministic Public-Key Encryption: The Auxillary-Input Setting [slides] The Collision Security of Tandem-DM in the Ideal Cipher Model [slides] Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions [slides] A New Variant of PMAC: Beyond the Birthday Bound [slides] Authenticated and Misuse-Resistant Encryption of Key-Dependent Data [slides] Round Optimal Blind Signatures [slides] Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups [slides] Constant-Rate Oblivious Transfer from Noisy Channels [slides] The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing [slides] Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials [slides] Inverting HFE Systems is Quasipolynomial for all Fields [slides] Smaller Decoding Exponents: Ball-Collision Decoding [slides] McEliece and Niederreiter Cryptosystems that Resist Quantum Fourier Sampling Attacks [slides] Fuente original
Leer más
