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 functions, based on, respectively, extracting square roots modulo a prime, the Fiat-Shamir signature scheme, and the Ong-Schnorr-Shamir (cracked) signature scheme.
Keywords
- Hash Function
- Signature Scheme
- Difference Parameter
- Price Function
- Hard Function
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download conference paper PDF
References
M. Blum and S. Micali, personal communication.
E. Biham and A. Shamir, Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI, and Lucifer, Crypto’ 91 abstracts.
B. den Boer and A. Bosselaers, An attack on the last two rounds of MD4, Crypto’ 91 abstracts.
E. F. Brickell and A. M. Odlyzko, Cryptanalysis: A Survey of Recent Results, Proceedings of the IEEE, vol. 76, pp. 578–593, May 1988.
D. Coppersmith, Another Birthday Attack, Proc. CRYPTO’ 85, Springer Verlag, LNCS, Vol. 218, pp. 369–378.
A. Fiat and A. Shamir, How to prove yourself, Proc. of Crypto 86, pp. 641–654.
B. A. Huberman, The Ecology of Computing, Studies in Computer Science and Artificial Intelligence 2, North Holland, Amsterdam, 1988.
R. Impagliazzo and M. Naor, Cryptographic schemes provably secure as subset sum, Proc. of the 30th FOCS, 1989.
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.
R. C. Merkle, One Way Functions and DES, Proc. of Crypto’89, pp. 428–446.
R. C. Merkle, Fast Software One-Way Hash Function, J. of Cryptology Vol 3, No. 1, pp. 43–58, 1990.
H. Ong, C. P. Schnorr and A. Shamir, An efficient signature scheme based on quadratic equations, Proc 16th STOC, 1984, pp. 208–216.
H. Ong, C. P. Schnorr and A. Shamir, Efficient signature scheme based on polynomial equations, Proc of Crypto 84, pp. 37–46.
J. M. Pollard and C. P. Schnorr, Solution of X 2 + ky 2 = m mod n, IEEE Trans. on Information Theory., 1988.
M. O. Rabin, Digital Signatures and Public Key Functions as Intractable as Factoring Technical Memo TM-212, Lab. for Computer Science, MIT, 1979.
R._L. Rivest, The MD4 Message Digest Algorithm, Proc of Crypto’90, pp. 303–311.
R. Schroepel and A. Shamir, A T = O(2n/2), S = O(2n/4) algorithm for certain NP-complete problems. SIAM J. Computing, 10 (1981), pp. 456–464.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dwork, C., Naor, M. (1993). Pricing via Processing or Combatting Junk Mail. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive