D. Chaum, editor. Advances in Cryptology, Crypto '83, Lecture Notes in Computer Science. Plenum Publishing, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An efficient ID-based group signature scheme - Popescu (2002) (Correct)
....as public key. The scheme is ideal for closed groups of users. Several ID based signature schemes have been proposed in the last years [7, 9, 10] Some of these schemes use Elliptic Curve (EC) algorithms and are therefore particularly e#cient. A group signature, introduced by Chaum and van Heyst [5], allows any member of a group to digitally sign a document such that a verifier can confirm that it came from the group but does not know which individual in the group signed the document. The scheme assumes the existence of a group manager whose sole purpose is to compute for each user a private ....
....done as follow: Computes e (U, V ) where (U, V ) is a purported signature on message m. Check whether e (U, V ) The signature is accepted if these values in G 2 match and rejected otherwise. 4. Group Signature Scheme A group signature, introduced by Chaum and van Heyst [5], allow any member of a group to sign on behalf of the group. Group signatures are publicly verifiable and can be verified with respect to a single group public key. Only a designated group manager, can revoke the anonymity of a group signature and find out the identity of the group member who ....
D. Chaum and E. Van Heyst, Group signatures, Advances in Cryptography, EUROCRYPT '91, Springer-Verlag, Lecture Notes in Computer Science, vol. 547, pp. 257-265, 1991.
A Modification Of The Tseng-Jan Group Signature Scheme - Popescu (2000) (Correct)
....allow individual members of a group to sign messages on behalf of the group while remaining anonymous. Furthermore, in case of disputes later a trusted authority, who is given some auxiliary information, can identify the signer. The concept of group signatures was introduced by Chaum and van Heyst [4]. Their schemes have been improved by L. Chen and T. Pedersen [5] who rst use a Schoenmaker s protocol [17] to hide a signer s identity. Also, H. Petersen suggested a general method to convert any ordinary digital signature into a group signature scheme [15] Petersen s method combines the ....
D. Chaum, E. Heyst, Group Signatures, Advances in Cryptology, EUROCRYPT'91, Lecture Notes in Computer Sciences 950, Springer-Verlag, 1992, pp. 257-265.
On the Security of RSA Padding - Coron, Naccache, Stern (1999) (15 citations) (Correct)
....n In general, x) hashes x and concatenates its digest to pre defined strings; in some cases, substitution and permutation are used as well. While most padding schemes gain progressive recognition as time goes by, several specific results exist : a few functions were broken by ad hoc analysis ([16, 24] showed, for instance, that homomorphic dependencies can still appear in (m) a Theta m b) while at the other extreme, assuming that the underlying building blocks are ideal, some functions [5, 6] are provably secure in the random oracle model. The contribution of this paper is that the ....
....A must exhibit the signature of at least one message (m ) which has never been submitted to S. Previous work : Misarsky s PKC 98 invited survey [30] is probably the best documented reference on multiplicative RSA forgeries. Davida s observation [9] is the basis of most RSA forgery techniques. [16, 24] forge signatures that are similar to pkcs #1 v2.0 but do not produce their necessary SHA MD5 digests [31, 34] 15] analyzes the security of RSA signatures in an interactive context. Michels et al. 28] create relations between the exponents of de Jonge Chaum and Boyd s schemes; their technique ....
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18--27, 1986.
On the Security of RSA Padding - Coron, Naccache, Stern (1999) (15 citations) Self-citation (Advances) (Correct)
No context found.
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18--27, 1986.
On the Security of RSA Padding - Coron, Naccache, Stern (1999) (15 citations) Self-citation (Advances) (Correct)
No context found.
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18--27, 1986.
On the Security of RSA Padding - Coron, Naccache, Stern (1999) (15 citations) Self-citation (Advances) (Correct)
No context found.
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18--27, 1986.
A Handy Multi-Coupon System - Sebastien Canard Aline (2006) (Correct)
No context found.
D. Chaum, editor. Advances in Cryptology, Crypto '83, Lecture Notes in Computer Science. Plenum Publishing, 1984.
Padding Attacks on RSA - David Naccache Gemplus (Correct)
No context found.
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18-27, 1986.
Padding Attacks on RSA - David Naccache Gemplus (Correct)
No context found.
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18--27, 1986.
An Efficient Strong Designated Verifier Signature Scheme - Saeednia, Kremer, Markowitch (Correct)
No context found.
D. Chaum and H. Van Antwerpen, Undeniable signatures, Advances in Cryptology (Proccedings of Crypto '90), Lecture Notes in Computer Science, vol. 435, SpringerVerlag, 1991, pp. 212-216.
Padding Attacks on RSA - Naccache (1999) (Correct)
No context found.
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18-27, 1986.
An Efficient Strong Designated Verifier Signature Scheme - Saeednia, Kremer, Markowitch (Correct)
No context found.
D. Chaum and H. Van Antwerpen, Undeniable signatures, Advances in Cryptology (Proccedings of Crypto '90), Lecture Notes in Computer Science, vol. 435, SpringerVerlag, 1991, pp. 212-216.
Padding Attacks on RSA - Naccache (1999) (Correct)
No context found.
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18-27, 1986.
Unknown - Http Virtualgoods Tu-Ilmenau (2003) (Correct)
No context found.
D. Chaum, A. Fiat, and M. Naor. Untraceable electronic cash. Lecture Notes in Computer Science, pages 319--327, 1988.
Padding Attacks on RSA - Naccache (1999) (Correct)
No context found.
W. de Jonge and D. Chaum. Attacks on some RSA signatures, Advances in cryptology crypto'85, Springer-Verlag, Lectures notes in computer science 218, pp. 18--27, 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC