International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Papers from CRYPTO 2008

Year
Venue
Title
2008
CRYPTO
A Framework for Efficient and Composable Oblivious Transfer
Chris Peikert Vinod Vaikuntanathan Brent Waters
2008
CRYPTO
Adaptive One-Way Functions and Applications
Omkant Pandey Rafael Pass Vinod Vaikuntanathan
2008
CRYPTO
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
Martijn Stam
2008
CRYPTO
Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys
Dimitar Jetchev Ramarathnam Venkatesan
2008
CRYPTO
Bug Attacks
Eli Biham Yaniv Carmeli Adi Shamir
2008
CRYPTO
Circular-Secure Encryption from Decision Diffie-Hellman
Dan Boneh Shai Halevi Mike Hamburg Rafail Ostrovsky
2008
CRYPTO
Collusion-Free Protocols in the Mediated Model
Joël Alwen Abhi Shelat Ivan Visconti
2008
CRYPTO
Communication Complexity in Algebraic Two-Party Protocols
Rafail Ostrovsky William E. Skeith III
2008
CRYPTO
Compression from Collisions, or Why CRHF Combiners Have a Long Output
Krzysztof Pietrzak
2008
CRYPTO
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
Phillip Rogaway John P. Steinberger
2008
CRYPTO
Cryptanalysis of MinRank
Jean-Charles Faugère Françoise Levy-dit-Vehel Ludovic Perret
2008
CRYPTO
Cryptanalysis of the GOST Hash Function
Florian Mendel Norbert Pramstaller Christian Rechberger Marcin Kontak Janusz Szmidt
2008
CRYPTO
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
Manoj Prabhakaran Mike Rosulek
2008
CRYPTO
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
Mihir Bellare Marc Fischlin Adam O'Neill Thomas Ristenpart
2008
CRYPTO
Distributed Private Data Analysis: Simultaneously Solving How and What
Amos Beimel Kobbi Nissim Eran Omri
2008
CRYPTO
Dynamic Threshold Public-Key Encryption
Cécile Delerablée David Pointcheval
2008
CRYPTO
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Yevgeniy Dodis Victor Shoup Shabsi Walfish
2008
CRYPTO
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
Payman Mohassel Enav Weinreb
2008
CRYPTO
Founding Cryptography on Oblivious Transfer - Efficiently
Yuval Ishai Manoj Prabhakaran Amit Sahai
2008
CRYPTO
How to Solve it: New Techniques in Algebraic Cryptanalysis
★Invited talk
Adi Shamir
2008
CRYPTO
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Sanjam Garg Raghav Bhaskar Satyanarayana V. Lokam
2008
CRYPTO
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
Helena Handschuh Bart Preneel
2008
CRYPTO
New Efficient Attacks on Statistical Disclosure Control Mechanisms
Cynthia Dwork Sergey Yekhanin
2008
CRYPTO
New State Recovery Attack on RC4
Alexander Maximov Dmitry Khovratovich
2008
CRYPTO
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
Chris Peikert Vinod Vaikuntanathan
2008
CRYPTO
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Alexandra Boldyreva Serge Fehr Adam O'Neill
2008
CRYPTO
On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoqCode Hopping Scheme
Thomas Eisenbarth Timo Kasper Amir Moradi Christof Paar Mahmoud Salmasizadeh Mohammad T. Manzuri Shalmani
2008
CRYPTO
One-Time Programs
Shafi Goldwasser Yael Tauman Kalai Guy N. Rothblum
2008
CRYPTO
Preimages for Reduced SHA-0 and SHA-1
Christophe De Cannière Christian Rechberger
2008
CRYPTO
Programmable Hash Functions and Their Applications
Dennis Hofheinz Eike Kiltz
2008
CRYPTO
Public-Key Locally-Decodable Codes
Brett Hemenway Rafail Ostrovsky
2008
CRYPTO
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
Ivan Damgård Yuval Ishai Mikkel Krøigaard Jesper Buus Nielsen Adam Smith
2008
CRYPTO
The MD6 hash function
★Invited talk
Ronald L. Rivest
2008
CRYPTO
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
★ Best Paper
Jean-Sébastien Coron Jacques Patarin Yannick Seurin