Sciweavers

10 search results - page 2 / 2
» Discrete-Log-Based Signatures May Not Be Equivalent to Discr...
Sort
View
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 8 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
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
13 years 9 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
Ernest F. Brickell, David Pointcheval, Serge Vaude...
NDSS
2003
IEEE
13 years 10 months ago
Proactive Two-Party Signatures for User Authentication
We study proactive two-party signature schemes in the context of user authentication. A proactive two-party signature scheme (P2SS) allows two parties—the client and the serverâ...
Antonio Nicolosi, Maxwell N. Krohn, Yevgeniy Dodis...
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 3 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
EUROCRYPT
1998
Springer
13 years 9 months ago
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...
Detlef Hühnlein, Michael J. Jacobson Jr., Sac...