ACM Home Page
Please provide us with feedback. Feedback
Group signatures á la carte
Full text PdfPdf (222 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents
Baltimore, Maryland, United States
Pages: 848 - 849  
Year of Publication: 1999
ISBN:0-89871-434-6
Authors
Giuseppe Ateniese  USC Information Sciences Institute, 4676 Admiralty Way, Marina Del Rey, CA
Gene Tsudik  USC Information Sciences Institute, 4676 Admiralty Way, Marina Del Rey, CA
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 27,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Gamenisch. Efficient and generalized group signatures.In Advances in Cryptology- EUROCRYPT, 1997.
 
2
 
3
A. Chan, Y. Frankel and Y. Tsiounis. Easy comeeasy go divisible cash. In Advances in Cryptology- EUROCRYPT, 1998.
 
4
D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology- EUROCRYPT, 1991.
 
5
 
6
C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.


Collaborative Colleagues:
Giuseppe Ateniese: colleagues
Gene Tsudik: colleagues