skip to main content
10.5555/646757.705669guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Pricing via Processing or Combatting Junk Mail

Published: 16 August 1992 Publication History

Abstract

We present a computational technique for combatting junk mail in particular and controlling access to a shared resource in general. The main idea is to require a user to compute a moderately hard, but not intractable, function in order to gain access to the resource, thus preventing frivolous use. To this end we suggest several pricing Junctions, based on, respectively, extracting square roots modulo a prime, the Fiat-Shamir signature scheme, and the Ong-Schnorr-Shamir (cracked) signature scheme.

References

[1]
M. Blum and S. Micali, personal communication .
[2]
E. Biham and A. Shamir, Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI, and Lucifer , Crypto '91 abstracts.
[3]
B. den Boer and A. Bosselaers, An attack on the last two rounds of MD4 , Crypto '91 abstracts.
[4]
E. F. Brickell and A. M. Odlyzko, Cryptanalysis: A Survey of Recent Results , Proceedings of the IEEE, vol. 76, pp. 578-593, May 1988.
[5]
D. Coppersmith, Another Birthday Attack , Proc. CRYPTO '85, Springer Verlag, LNCS, Vol. 218, pp. 369-378.
[6]
A. Fiat and A. Shamir, How to prove yourself , Proc. of Crypto 86, pp. 641-654.
[7]
B. A. Huberman, The Ecology of Computing, Studies in Computer Science and Artificial Intelligence 2, North Holland, Amsterdam, 1988.
[8]
R. Impagliazzo and M. Naor, Cryptographic schemes provably secure as subset sum , Proc. of the 30th FOCS, 1989.
[9]
K. McCurley, Odd and ends from cryptology and computational number theory , in crypttoloy and computational number theory, edited by C. Pomerance, AMS short course, 1990, pp. 145-166.
[10]
R. C. Merkle, One Way Functions and DES , PTOC. of Crypto'89, pp. 428-446.
[11]
R. C. Merkle, Fast Software One-Way Hash Function , J. of Cryptoiogy Vol 3, No. 1, pp. 43-58, 1990.
[12]
H. Ong, C. P: Schnorr and A. Shamir, An efficient signature scheme based on quadratic equations , Proc 16th STOC, 1984, pp. 208-216.
[13]
H. Ong, C. P. Schnorr and A. Shamir, Efficient signature scheme based on polynomial equations , Proc of Crypto 84, pp. 37-46.
[14]
J. M. Pollard and C. P. Schnorr, Solution of X 2 + ky 2 = m mod n , IEEE Trans, on Information Theory., 1988.
[15]
M. O. Rabin, Digital Signatures and Public Key Functions as Intractable as Factoring Technical Memo TM-212, Lab. for Computer Science, MIT, 1979.
[16]
R. L. Rivest, The MD4 Message Digest Algorithm , Proc of Crypto'90, pp. 303-311.
[17]
R. Schroepel and A. Shamir, A T = O (2 n /2), S = O (2 n /4) algorithm for certain NP-complete problems . SIAM J. Computing, 10 (1981), pp. 456-464.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
CRYPTO '92: Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
August 1992
593 pages
ISBN:3540573402

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 16 August 1992

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media