摘要: We present a computational technique for combatting junk mail in particular and controlling access to shared resource general. The main idea is require user compute moderately hard, but not intractable, function order gain the resource, thus preventing frivolous use. To this end we suggest several pricing Junctions, based on, respectively, extracting square roots modulo prime, Fiat-Shamir signature scheme, Ong-Schnorr-Shamir (cracked) scheme.
springer.com
dal.ca 
acm.org 参考文章(19)
H. Ong, C. P. Schnorr, A. Shamir, Efficient Signature Schemes Based on Polynomial Equations (preliminary version) theory and application of cryptographic techniques. pp. 37- 46 ,(1984) , 10.1007/3-540-39568-7_4
Neal Koblitz, A Course in Number Theory and Cryptography ,(1987)
Don Coppersmith, Another Birthday Attack international cryptology conference. pp. 14- 17 ,(1986) , 10.1007/3-540-39799-X_2
Eli Biham, Adi Shamir, Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer international cryptology conference. pp. 156- 171 ,(1991) , 10.1007/3-540-46766-1_11
C P Schnorr, Adi Shamir, H Ong, Efficient signature schemes based on polynomial equations international cryptology conference. pp. 37- 46 ,(1985)
Ralph C. Merkle, One way hash functions and DES international cryptology conference. pp. 428- 446 ,(1989) , 10.1007/0-387-34805-0_40
Richard Schroeppel, Adi Shamir, A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems SIAM Journal on Computing. ,vol. 10, pp. 456- 464 ,(1981) , 10.1137/0210033
R. Impagliazzo, M. Naor, Efficient cryptographic schemes provably as secure as subset sum foundations of computer science. pp. 236- 241 ,(1989) , 10.1109/SFCS.1989.63484
Ralph C. Merkle, A fast software one-way hash function Journal of Cryptology. ,vol. 3, pp. 43- 58 ,(1990) , 10.1007/BF00203968
H. Ong, C. P. Schnorr, A. Shamir, An efficient signature scheme based on quadratic equations symposium on the theory of computing. pp. 208- 216 ,(1984) , 10.1145/800057.808683