Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CRYPTO
2008
Springer
120views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
Jean-Sébastien Coron, Jacques Patarin, Yann...
CRYPTO
2008
Springer
109views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
Adaptive One-Way Functions and Applications
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
Public-Key Locally-Decodable Codes
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
Brett Hemenway, Rafail Ostrovsky
CRYPTO
2008
Springer
76views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
Ivan Damgård, Yuval Ishai, Mikkel Krø...
CRYPTO
2008
Springer
150views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
Alexandra Boldyreva, Serge Fehr, Adam O'Neill
CRYPTO
2008
Springer
75views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
New Efficient Attacks on Statistical Disclosure Control Mechanisms
The goal of a statistical database is to provide statistics about a population while simultaneously protecting the privacy of the individual records in the database. The tension be...
Cynthia Dwork, Sergey Yekhanin
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak
CRYPTO
2008
Springer
95views Cryptology» more  CRYPTO 2008»
11 years 3 months ago
Programmable Hash Functions and Their Applications
Dennis Hofheinz, Eike Kiltz
books