D. Chaum, E. van Heyst: Group Signatures, Proceedings of Eurocrypt '91, Lecture Notes in Computer Science 547, Springer Verlag, pp. 257-265. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Proofs of Partial Knowledge and Simplified Design of Witness.. - Cramer (1994) (103 citations) (Correct)
....was introduced in [5] By this method, a signature can be computed which will show that a quali ed subset was present, without revealing which subset was involved. This is a generalization of the results from e.g. 10] and also of the group signature concept, introduced by Chaum and Van Heyst [2]. One aspect of group signatures which is missing here, however, is that it is not possible later to open signatures to discover the identities of users involved. Note also that our method allows participants to form groups completely freely, using the same keys in all groups. For example, two ....
D. Chaum and E. van Heyst: Group Signatures, Proc. of EuroCrypt 91, Springer Verlag LNCS series.
Proofs of Partial Knowledge and Simplified Design of.. - Cramer, Damgård.. (1995) (103 citations) (Correct)
....was introduced in [5] By this method, a signature can be computed which will show that a qualified subset was present, without revealing which subset was involved. This is a generalization of the results from e.g. 10] and also of the group signature concept, introduced by Chaum and Van Heyst [2]. One aspect of group signatures which is missing here, however, is that it is not possible later to open signatures to discover the identities of users involved. Note also that our method allows participants to form groups completely freely, using the same keys in all groups. For example, two ....
D. Chaum and E. van Heyst: Group Signatures, Proc. of EuroCrypt 91, Springer Verlag LNCS series.
Proofs of Partial Knowledge and Simplified Design of.. - Cramer, Damgård.. (1995) (103 citations) (Correct)
....first message (this technique was introduced in [5] By this method, a signature can be computed which will show that a qualified subset was present, without revealing which subset was involved. This may be seen as a generalization of the group signature concept, introduced by Chaum and Van Heyst [2]. One aspect of group signatures which is missing here, however, is that it is not possible later to open signatures to discover the identities of users involved. 6. Open Problems Two obvious open problems remain. First, can Theorem 1 be proved assuming ordinary soundness of P, and not special ....
D. Chaum and E. van Heyst: Group Signatures, Proc. of EuroCrypt 91, Springer Verlag LNCS series.
Fair Blind Signatures - Stadler, Piveteau, Camenisch (1995) (62 citations) (Correct)
No context found.
D. Chaum, E. van Heyst: Group Signatures, Proceedings of Eurocrypt '91, Lecture Notes in Computer Science 547, Springer Verlag, pp. 257-265.
Fair Blind Signatures - Stadler, Piveteau, Camenisch (1995) (62 citations) (Correct)
No context found.
D. Chaum, E. van Heyst: Group Signatures, Proceedings of Eurocrypt '91, Lecture Notes in Computer Science 547, Springer Verlag, pp. 257-265.
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