Foro de elhacker.net

Crypto es una conferencia internacional sobre criptografía, que se celebra todos los años en la Universidad de California.

• Leftover Hash Lemma, Revisited (http://www.iacr.org/conferences/crypto2011/abstracts/001.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/01-1-Dodis.pdf)
• Random Oracle Reducibility (http://www.iacr.org/conferences/crypto2011/abstracts/021.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/01-2-Baecher.pdf)
• Time-Lock Puzzles in the Random Oracle Model (http://www.iacr.org/conferences/crypto2011/abstracts/039.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/01-3-Mahmoody.pdf)
• Physically Uncloneable Functions in the Universal Composition Framework (http://www.iacr.org/conferences/crypto2011/abstracts/051.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/01-4-Brzuska.pdf)
• Computer-Aided Security Proofs for the Working Cryptographer (http://www.iacr.org/conferences/crypto2011/abstracts/071.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/02-1-Barthe.pdf)
• Illegitimi Non Carborundum [slides] (http://www.iacr.org/conferences/crypto2011/slides/Rivest.pdf)
• Optimal Verification of Operations on Dynamic Sets (http://www.iacr.org/conferences/crypto2011/abstracts/091.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/03-1-Papamanthou.pdf)
• Verificable Delegation of Computation over Large Datasets (http://www.iacr.org/conferences/crypto2011/abstracts/110.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/03-2-Vahlis.pdf)
• Secure Computation on the Web: Computing Without Simultaneous Interaction (http://www.iacr.org/conferences/crypto2011/abstracts/128.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/03-3-Lindell.pdf)
• Memory Delegation (http://www.iacr.org/conferences/crypto2011/abstracts/147.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/03-4-Chung.pdf)
• Automatic Search of Attacks on Round-Reduced AES and Applications (http://www.iacr.org/conferences/crypto2011/abstracts/165.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/04-1-Bouillaguet.pdf)
• How to Improve Rebound Attacks (http://www.iacr.org/conferences/crypto2011/abstracts/184.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/04-2-Naya-Plasencia.pdf)
• A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack (http://www.iacr.org/conferences/crypto2011/abstracts/202.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/04-3-Leander.pdf)
• The PHOTON Family of Lightweight Hash Functions (http://www.iacr.org/conferences/crypto2011/abstracts/219.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/04-4-Guo.pdf)
• Perfectly-Secure Multiplication for any t n/3 (http://www.iacr.org/conferences/crypto2011/abstracts/237.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/05-1-Asharov.pdf)
• The IPS Compiler: Optimizations, Variants and Concrete Efficiency (http://www.iacr.org/conferences/crypto2011/abstracts/255.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/05-2-Lindell.pdf)
• 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds (http://www.iacr.org/conferences/crypto2011/abstracts/273.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/05-3-Orlov.pdf)
• Leakage-Resilient Zero Knowledge (http://www.iacr.org/conferences/crypto2011/abstracts/293.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/06-1-Garg.pdf)
• A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework (http://www.iacr.org/conferences/crypto2011/abstracts/311.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/06-2-Whitnall.pdf)
• Key-Evolution Schemes Resilient to Space-Bounded Leakage (http://www.iacr.org/conferences/crypto2011/abstracts/330.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/06-3-Kazana.pdf)
• Generic Side-Channel Distinguishers: Improvements and Limitations (http://www.iacr.org/conferences/crypto2011/abstracts/348.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/06-4-Veyrat-Charvillon.pdf)
• Cryptography with Tamperable and Leaky Memory (http://www.iacr.org/conferences/crypto2011/abstracts/367.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/06-5-Kanukurthi.pdf)
• Tutorial Session — Fully Homomorphic Encryption, by Shai Halevi [slides] (http://www.iacr.org/conferences/crypto2011/slides/Halevi.pdf)
• Merkle Puzzles in a Quantum World (http://www.iacr.org/conferences/crypto2011/abstracts/385.htm) Classical Cryptographic Protocols in a Quantum World (http://www.iacr.org/conferences/crypto2011/abstracts/405.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/07-2-Song.pdf)
• Position-Based Quantum Cryptography: Impossibility and Constructions (http://www.iacr.org/conferences/crypto2011/abstracts/423.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/07-3-Schaffner.pdf)
• Analyzing Blockwise Lattice Algorithms using Dynamical Systems (http://www.iacr.org/conferences/crypto2011/abstracts/441.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/08-1-Pujol.pdf)
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions (http://www.iacr.org/conferences/crypto2011/abstracts/461.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/08-2-Mol.pdf)
• Tor and Circumvention: Lessons Learned (http://www.iacr.org/conferences/crypto2011/abstracts/481.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/Dingledine.pdf)
• Fully Homomorphic Encryption over the Integers with Shorter Public-Keys (http://www.iacr.org/conferences/crypto2011/abstracts/483.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/09-1-Tibouchi.pdf)
• Fully Homomorphic Encryption for Ring-LWE and Security for Key Dependent Messages (http://www.iacr.org/conferences/crypto2011/abstracts/501.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/09-2-Brakerski.pdf)
• Bi-Deniable Public-Key Encryption (http://www.iacr.org/conferences/crypto2011/abstracts/521.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/09-3-Peikert.pdf)
• Better Security for Deterministic Public-Key Encryption: The Auxillary-Input Setting (http://www.iacr.org/conferences/crypto2011/abstracts/539.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/09-4-Segev.pdf)
• The Collision Security of Tandem-DM in the Ideal Cipher Model (http://www.iacr.org/conferences/crypto2011/abstracts/557.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/10-1-Lee.pdf)
• Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions (http://www.iacr.org/conferences/crypto2011/abstracts/575.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/10-2-Chenette.pdf)
• A New Variant of PMAC: Beyond the Birthday Bound (http://www.iacr.org/conferences/crypto2011/abstracts/593.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/10-3-Yasuda.pdf)
• Authenticated and Misuse-Resistant Encryption of Key-Dependent Data (http://www.iacr.org/conferences/crypto2011/abstracts/607.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/10-4-Keelveedhi.pdf)
• Round Optimal Blind Signatures (http://www.iacr.org/conferences/crypto2011/abstracts/627.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/11-1-Garg-Schroeder.pdf)
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups (http://www.iacr.org/conferences/crypto2011/abstracts/646.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/11-2-Groth.pdf)
• Constant-Rate Oblivious Transfer from Noisy Channels (http://www.iacr.org/conferences/crypto2011/abstracts/664.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/12-1-Prabhakaran.pdf)
• The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing (http://www.iacr.org/conferences/crypto2011/abstracts/682.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/12-2-Cascudo.pdf)
• Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials (http://www.iacr.org/conferences/crypto2011/abstracts/703.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/13-1-Sakumoto.pdf)
• Inverting HFE Systems is Quasipolynomial for all Fields (http://www.iacr.org/conferences/crypto2011/abstracts/721.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/13-2-Ding-Hodges.pdf)
• Smaller Decoding Exponents: Ball-Collision Decoding (http://www.iacr.org/conferences/crypto2011/abstracts/740.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/13-3-Bernstein.pdf)
• McEliece and Niederreiter Cryptosystems that Resist Quantum Fourier Sampling Attacks (http://www.iacr.org/conferences/crypto2011/abstracts/758.htm) [slides] (http://www.iacr.org/conferences/crypto2011/slides/13-4-Dinh.pdf)

Leído en CyberHades (http://www.cyberhades.com/2011/08/30/presentaciones-de-la-crypto-2011/)
Página Oficial | Crypto (http://www.iacr.org/conferences/crypto2011/index-test.shtml)
Página con el programa (http://rump2011.cr.yp.to/).