Sciweavers

49 search results - page 3 / 10
» A Feebly Secure Trapdoor Function
Sort
View
IWSEC
2009
Springer
13 years 11 months ago
Reducing Complexity Assumptions for Oblivious Transfer
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important and interesting task in theoretical cryptography. Oblivious Transfer, one of ...
K. Y. Cheong, Takeshi Koshiba
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
14 years 2 months ago
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
Yevgeniy Vahlis
PKC
2012
Springer
279views Cryptology» more  PKC 2012»
11 years 7 months ago
Circular and KDM Security for Identity-Based Encryption
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
Jacob Alperin-Sheriff, Chris Peikert
CRYPTO
1997
Springer
207views Cryptology» more  CRYPTO 1997»
13 years 9 months ago
Public-Key Cryptosystems from Lattice Reduction Problems
We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the ...
Oded Goldreich, Shafi Goldwasser, Shai Halevi
ACNS
2010
Springer
154views Cryptology» more  ACNS 2010»
13 years 10 months ago
Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ2 ) group elements...
Xavier Boyen, Brent Waters