Sciweavers

21 search results - page 2 / 5
» Designated Confirmer Signatures and Public-Key Encryption ar...
Sort
View
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 5 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
ENTCS
2006
124views more  ENTCS 2006»
13 years 5 months ago
A New Rabin-type Trapdoor Permutation Equivalent to Factoring
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
Katja Schmidt-Samoa
DCC
2007
IEEE
14 years 4 months ago
ID-based cryptography using symmetric primitives
A general method for deriving an identity-based public key cryptosystem from a one-way function is described. We construct both ID-based signature schemes and ID-based encryption ...
Chris J. Mitchell, Fred Piper, Peter R. Wild
ASIACRYPT
2003
Springer
13 years 9 months ago
Universal Designated-Verifier Signatures
Motivated by privacy issues associated with dissemination of signed digital certificates, we define a new type of signature scheme called a `Universal Designated-Verifier Signatur...
Ron Steinfeld, Laurence Bull, Huaxiong Wang, Josef...
ASIACRYPT
2009
Springer
13 years 12 months ago
Group Encryption: Non-interactive Realization in the Standard Model
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
Julien Cathalo, Benoît Libert, Moti Yung