Secure Proxy Signature Schemes for Delegation of Signing Rights Alexandra BoldyrevaAdriana PalacioBogdan Warinschi OriginalPaper 16 October 2010 Pages: 57 - 115
Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive Abhranil MaitiPatrick Schaumont OriginalPaper 14 October 2010 Pages: 375 - 397
Which Languages Have 4-Round Zero-Knowledge Proofs? Jonathan Katz OriginalPaper 08 October 2010 Pages: 41 - 56
Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation Rahul Jain OriginalPaper 02 October 2010 Pages: 1 - 13
Resource Fairness and Composability of Cryptographic Protocols Juan A. GarayPhilip MacKenzieKe Yang OriginalPaper 21 September 2010 Pages: 615 - 658
Secure Computation Without Authentication Boaz BarakRan CanettiTal Rabin OriginalPaper 15 September 2010 Pages: 720 - 760
Efficient Selective Identity-Based Encryption Without Random Oracles Dan BonehXavier Boyen OriginalPaper 15 September 2010 Pages: 659 - 693
Partial Fairness in Secure Two-Party Computation S. Dov GordonJonathan Katz OriginalPaper 15 September 2010 Pages: 14 - 40
Securely Obfuscating Re-Encryption Susan HohenbergerGuy N. RothblumVinod Vaikuntanathan OriginalPaper 08 September 2010 Pages: 694 - 719
Tweakable Block Ciphers Moses LiskovRonald L. RivestDavid Wagner OriginalPaper Open access 02 September 2010 Pages: 588 - 613
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer Yehuda LindellHila Zarosim OriginalPaper 28 July 2010 Pages: 761 - 799
An Analysis of the Blockcipher-Based Hash Functions from PGV J. BlackP. RogawayM. Stam OriginalPaper 16 July 2010 Pages: 519 - 545
Short Undeniable Signatures Based on Group Homomorphisms Jean MonneratSerge Vaudenay OriginalPaper 18 June 2010 Pages: 545 - 587
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs Dafna KidronYehuda Lindell OriginalPaper 08 June 2010 Pages: 517 - 544
Structural Cryptanalysis of SASAS Alex BiryukovAdi Shamir OriginalPaper 08 June 2010 Pages: 505 - 518
Long-Term Security and Universal Composability Jörn Müller-QuadeDominique Unruh OriginalPaper 28 May 2010 Pages: 594 - 671
A Verifiable Secret Shuffle of Homomorphic Encryptions Jens Groth OriginalPaper 14 May 2010 Pages: 546 - 579
Possibility and Impossibility Results for Selective Decommitments Dennis Hofheinz OriginalPaper 13 May 2010 Pages: 470 - 516
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves Steven D. GalbraithXibin LinMichael Scott OriginalPaper 04 May 2010 Pages: 446 - 469
Utility Dependence in Correct and Fair Rational Secret Sharing Gilad AsharovYehuda Lindell OriginalPaper 27 March 2010 Pages: 157 - 202
Cryptanalysis of the Tillich–Zémor Hash Function Markus GrasslIvana IlićRainer Steinwandt OriginalPaper 16 March 2010 Pages: 148 - 156
Universally Composable Symbolic Security Analysis Ran CanettiJonathan Herzog OriginalPaper 09 March 2010 Pages: 83 - 147
Parallel and Concurrent Security of the HB and HB+ Protocols Jonathan KatzJi Sun ShinAdam Smith OriginalPaper 17 February 2010 Pages: 402 - 421
Wildcarded Identity-Based Encryption Michel AbdallaJames BirkettNigel P. Smart OriginalPaper 12 February 2010 Pages: 42 - 82
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves Andreas EngePierrick GaudryEmmanuel Thomé OriginalPaper 10 February 2010 Pages: 24 - 41
On d-Multiplicative Secret Sharing Omer BarkolYuval IshaiEnav Weinreb OriginalPaper 05 February 2010 Pages: 580 - 593
Secure Computation of the Median (and Other Elements of Specified Ranks) Gagan AggarwalNina MishraBenny Pinkas OriginalPaper 05 February 2010 Pages: 373 - 401
Practical Collisions for EnRUPT Sebastiaan IndesteegeBart Preneel OriginalPaper 05 February 2010 Pages: 1 - 23
Discrete Logarithm Problems with Auxiliary Inputs Jung Hee Cheon OriginalPaper 11 December 2009 Pages: 457 - 476
The TLS Handshake Protocol: A Modular Analysis P. MorrisseyN. P. SmartB. Warinschi OriginalPaper 29 October 2009 Pages: 187 - 223
Breaking the Stream Ciphers F-FCSR-H and F-FCSR-16 in Real Time Martin HellThomas Johansson OriginalPaper 29 October 2009 Pages: 427 - 445
Cryptanalysis of MD2 Lars R. KnudsenJohn Erik MathiassenSøren S. Thomsen OriginalPaper 28 October 2009 Pages: 72 - 90
A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack Yvo DesmedtRosario GennaroVictor Shoup OriginalPaper 11 September 2009 Pages: 91 - 120
On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits Oded Goldreich OriginalPaper 13 August 2009 Pages: 1 - 36
Efficient Cache Attacks on AES, and Countermeasures Eran TromerDag Arne OsvikAdi Shamir OriginalPaper 23 July 2009 Pages: 37 - 71
A Taxonomy of Pairing-Friendly Elliptic Curves David FreemanMichael ScottEdlyn Teske OriginalPaper Open access 18 June 2009 Pages: 224 - 280
Obfuscation for Cryptographic Purposes Dennis HofheinzJohn Malone-LeeMartijn Stam OriginalPaper 13 June 2009 Pages: 121 - 168
New Approaches for Deniable Authentication Mario Di RaimondoRosario Gennaro OriginalPaper 28 May 2009 Pages: 572 - 615
Efficient Non-malleable Commitment Schemes Marc FischlinRoger Fischlin OriginalPaper 13 May 2009 Pages: 530 - 571
The RSA Group is Pseudo-Free Daniele Micciancio OriginalPaper Open access 07 May 2009 Pages: 169 - 186
Efficient Non-Malleable Commitment Schemes Marc FischlinRoger Fischlin OriginalPaper 29 April 2009 Pages: 203 - 244
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves, Benjamin Smith OriginalPaper 11 April 2009 Pages: 505 - 529
The Twin Diffie–Hellman Problem and Applications David CashEike KiltzVictor Shoup OriginalPaper 11 April 2009 Pages: 470 - 504
Cryptography with Constant Input Locality Benny ApplebaumYuval IshaiEyal Kushilevitz OriginalPaper 11 April 2009 Pages: 429 - 469
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries Yonatan AumannYehuda Lindell OriginalPaper 07 April 2009 Pages: 281 - 343
On the Efficient Generation of Prime-Order Elliptic Curves Elisavet KonstantinouAristides KontogeorgisChristos Zaroliagis OriginalPaper 31 March 2009 Pages: 477 - 503
Non-interactive Timestamping in the Bounded-Storage Model Tal MoranRonen ShaltielAmnon Ta-Shma OriginalPaper 10 January 2009 Pages: 189 - 226
A Proof of Security of Yao’s Protocol for Two-Party Computation Yehuda LindellBenny Pinkas OriginalPaper 09 December 2008 Pages: 161 - 188
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries Carmit HazayYehuda Lindell OriginalPaper 18 November 2008 Pages: 422 - 456
A Public Key Cryptosystem Based on Non-abelian Finite Groups Wolfgang LempkenTrung van TranWandi Wei OriginalPaper 11 November 2008 Pages: 62 - 74
