Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications by Conference
Links to individual LNCS volumes are
here
. Unfortunately FSE 2013 data was never captured.
Crypto 2011
Page
Title
1
Leftover Hash Lemma, Revisited
21
Random Oracle Reducibility
39
Time-Lock Puzzles in the Random Oracle Model
51
Physically Uncloneable Functions in the Universal Composition Framework
71
Computer-Aided Security Proofs for the Working Cryptographer
91
Optimal Verification of Operations on Dynamic Sets
110
Verifiable Delegation of Computation over Large Datasets
128
Secure Computation on the Web: Computing without Simultaneous Interaction
147
Memory Delegation
165
Automatic Search of Attacks on Round-Reduced AES and Applications
184
How to Improve Rebound Attacks
202
A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
219
The PHOTON Family of Lightweight Hash Functions
237
Perfectly-Secure Multiplication for any t<n/3
255
The IPS Compiler: Optimizations, Variants and Concrete Efficiency
273
$1/p$-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
293
Leakage-Resilient Zero Knowledge
311
A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework
330
Key-Evolution Schemes Resilient to Space-Bounded Leakage
348
Generic Side-Channel Distinguishers: Improvements and Limitations
367
Cryptography with Tamperable and Leaky Memory
385
Merkle Puzzles in a Quantum World
405
Classical Cryptographic Protocols in a Quantum World
423
Position-Based Quantum Cryptography: Impossibility and Constructions
441
Analyzing Blockwise Lattice Algorithms using Dynamical Systems
461
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
481
Tor and Circumvention: Lessons Learned
483
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
501
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
521
Bi-Deniable Public-Key Encryption
539
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
557
The Collision Security of Tandem-DM in the Ideal Cipher Model
575
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
593
A New Variant of PMAC: Beyond the Birthday Bound
607
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data
627
Round Optimal Blind Signatures in the Standard Model
646
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
664
Constant-Rate Oblivious Transfer from Noisy Channels
682
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing
703
Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
721
Inverting HFE Systems is Quasi-Polynomial for All Fields
740
Smaller Decoding Exponents: Ball-Collision Decoding
758
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks