Sciweavers

127 search results - page 9 / 26
» On Cryptographic Schemes Based on Discrete Logarithms and Fa...
Sort
View
ECCC
2007
185views more  ECCC 2007»
14 years 9 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
15 years 2 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
JOC
2007
129views more  JOC 2007»
14 years 9 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng
ARITH
1999
IEEE
15 years 2 months ago
Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
Thomas Blum
ASIACRYPT
2004
Springer
15 years 3 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di...
Jean Monnerat, Serge Vaudenay