|
Search the dblp DataBase
Jan-Hendrik Evertse:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- David Chaum, Jan-Hendrik Evertse
Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers. [Citation Graph (0, 0)][DBLP] CRYPTO, 1985, pp:192-211 [Conf]
- David Chaum, Jan-Hendrik Evertse
A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations. [Citation Graph (0, 0)][DBLP] CRYPTO, 1986, pp:118-167 [Conf]
- David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf, René Peralta
Demonstrating Possession of a Discrete Logarithm Without Revealing It. [Citation Graph (0, 0)][DBLP] CRYPTO, 1986, pp:200-212 [Conf]
- David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf
An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations. [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1987, pp:127-141 [Conf]
- Jan-Hendrik Evertse
Linear Structures in Blockciphers. [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1987, pp:249-266 [Conf]
- Jan-Hendrik Evertse, Eugène van Heyst
Which New RSA Signatures Can Be Computed From Some Given RSA Signatures? [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1990, pp:83-97 [Conf]
- Jan-Hendrik Evertse, Eugène van Heyst
Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol? [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1992, pp:378-389 [Conf]
- Jan-Hendrik Evertse, Eugène van Heyst
Which New RSA-Signatures Can be Computed from Certain Given RSA-Signatures? [Citation Graph (0, 0)][DBLP] J. Cryptology, 1992, v:5, n:1, pp:41-52 [Journal]
Search in 0.002secs, Finished in 0.002secs
|