Probabilistic counting of large digital signature collections

Proceedings of the 9th USENIX Security Symposium

Volumn , Issue , 2000, Pages

  Kuhn, Markus G ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; WEBSITES;

DELEGATION OF POWER; ELECTRONIC DISCUSSIONS; NON-UNIFORM; NUMBER OF PEOPLES; RANKING MECHANISMS; SECURE HASH FUNCTION; THIRD PARTIES;

NETWORK SECURITY;

EID: 85084161724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Moni Naor, Benny Pinkas: Secure and Efficient Metering. In Kaisa Nyberg (ed.): Advances in Cryptology - EUROCRYPT '98, LNCS 1403, pp. 576-590. Springer-Verlag May/June 1998.
2. Burt Kaliski, Jessica Staddon: PKCS #1: RSA Cryptography Standard - Version 2.0. RSA Laboratories, September 1998. http://www.rsasecurity.com/rsalabs/pkcs/pkcs-1/
3. Mihir Bellare, Phillip Rogaway: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In Ueli Maurer (ed.): Advances in Cryptology - EUROCRYPT '96, LNCS 1070, pp. 399-416. Springer-Verlag, May 1998.
4. Digital Signature Standard (DSS). Federal Information Processing Standards Publication FIPS PUB 186-1, U.S. Department of Commerce, December 1988.
5. Robert Morris: Counting Large Numbers of Events in Small Registers. Communications of the ACM, Vol. 21, No. 10, pp. 840-842, October 1978.
6. Philippe Flajolet, G. Nigel Martin: Probabilistic Counting Algorithms for Data Base Applications. Journal of Computer and System Sciences, Vol. 31, No. 2, pp. 182-209, October 1985.
7. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems. In W. Kuich (ed.): Automata, Languages and Programming, 19th International Colloquium, pp. 211-222, Wien, Austria, 13-17 July 1992. Springer-Verlag.