Crypto 2011 Rump Session
31 talks · 2011 · indexed by Breach Arc Archive. Links open each talk on YouTube.
Browse with filters →- (More) Efficient Secure Computation from Garbled Circuits 2011
- A brief chat about approximate GCDs 2011
- A silent competition for ultra-fast public key cryptography 2011
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption 2011
- An update about HiDalgo: 2011
- Biclique cryptanalysis of the full AES 2011
- Blinding ballot copying in Helios: from Condorcet to IACR 2011
- Bounds on Cloud File Retrievability 2011
- Computer-Aided Search Heuristic for Blind Revocable Identity Based Encryption Schemes 2011
- Consensus in the Asynchronous Hybrid Byzantine Model with Optimal Resilience 2011
- Extreme Threshold Cryptosystems 2011
- FlipIt and the Cramér-Rao bound 2011
- HB^N: An HB-like protocol secure against Man-in-the-Middle attacks 2011
- Illegitimi Non Irritatum (aut Lorem Ipsum Deserti Omnium) 2011
- Improving the Indifferentiability Security Bounds for the Fast Wide-pipe and the JH Modes 2011
- NIST Announcements 2011
- Non-Malleable Codes in the Split-State Model 2011
- Observations on H-PRESENT-128 2011
- Panel discussion on leakage 2011
- Practical demonstration of Bananb Target Collisions for Skein with NIST KAT files 2011
- Predicate Encryption for Inner Products from LWE 2011
- Pseudorandom Functions and Lattices 2011
- Remotegrity 2011
- Rethinking IDEA 2011
- Robust Coin Flipping 2011
- Secure Computation with Sublinear Amortized Work 2011
- Secure Verification of Delegated Presentation Delivery 2011
- The Garden-Hose Model 2011
- The Hunting of the SNARK 2011
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller 2011
- Variants of Sponge-like Construction 2011