Cryptography Reference
In-Depth Information
[203] R. Solovay and V. Strassen. A Fast Monte-Carlo Test for Primality. SIAM Journal on
Computing , Vol. 6, pages 84-85, 1977. (Addendum in SIAM Journal on Computing ,
Vol. 7, page 118, 1978.)
[204] M. Sudan. Decoding of Reed-Solomon Codes beyond the Error-Correction Bound. Journal
of Complexity , Vol. 13, No. 1, pages 180-193, 1997.
[205] M. Tompa and H. Woll. Random Self-Reducibility and Zero-Knowledge Interactive Proofs
of Possession of Information. In 28th IEEE Symposium on Foundations of Computer
Science , pages 472-482, 1987.
[206] S. Vadhan. A Study of Statistical Zero-Knowledge Proofs. Ph.D. thesis, Department of
Mathematics, MIT, Cambridge, MA, 1999.
[207] A. Vardi. Algorithmic Complexity in Coding Theory and the Minimum Distance Problem.
In 29th ACM Symposium on the Theory of Computing , pages 92-108, 1997.
[208] U.V. Vazirani and V.V. Vazirani. Efficient and Secure Pseudo-Random Number Genera-
tion. In 25th IEEE Symposium on Foundations of Computer Science , pages 458 - 463,
1984.
[209] M. Wegman and L. Carter. New Hash Functions and Their Use in Authentication and Set
Equality. Journal of Computer and System Science , Vol. 22, pages 265-279, 1981.
[210] A.C. Yao. Theory and Application of Trapdoor Functions. In 23rd IEEE Symposium on
Foundations of Computer Science , pages 80-91, 1982.
[211] A.C. Yao. How to Generate and Exchange Secrets. In 27th IEEE Symposium on Founda-
tions of Computer Science , pages 162-167, 1986.
Search WWH ::




Custom Search