17 search results - page 3 / 4 » Improved Non-committing Encryption Schemes Based on a Genera... |
201
click to vote
EUROCRYPT
2005
Springer
16 years 1 months ago
2005
Springer
We present a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup’s notion of smooth projective hashing (2002). ...
194
click to vote
ICALP
2005
Springer
16 years 1 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
218
Voted
CRYPTO
2006
Springer
15 years 11 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
232
click to vote
ESAS
2004
Springer
16 years 26 days ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
212
click to vote
CCS
2008
ACM
15 years 9 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...