Sciweavers

35 search results - page 3 / 7
» Trapdoors for Hard Lattices and New Cryptographic Constructi...
Sort
View
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 9 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
13 years 10 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
13 years 11 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
CRYPTO
1997
Springer
207views Cryptology» more  CRYPTO 1997»
13 years 10 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
TCC
2010
Springer
163views Cryptology» more  TCC 2010»
14 years 1 months ago
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
Benoît Libert, Moti Yung