Cryptography Reference
In-Depth Information
Vol. 168, American Mathematical Society, pages 269-278, 1994. (Available from
http://www.research.att.com/
∼
amo.
)
[180] T. Okamoto. On Relationships between Statistical Zero-Knowledge Proofs. In
28th ACM
Symposium on the Theory of Computing
, pages 649-658, 1996.
[181] R. Ostrovsky and A. Wigderson. One-Way Functions Are Essential for Non-Trivial
Zero-Knowledge. In
2nd Israel Symposium on Theory of Computing and Systems
, IEEE
Comp. Soc. Press, pages 3-17, 1993.
[182] R. Ostrovsky and M. Yung. How to Withstand Mobile Virus Attacks. In
10th ACM Sym-
posium on Principles of Distributed Computing
, pages 51-59, 1991.
[183] B. Pfitzmann.
Digital Signature Schemes
(
General Framework and Fail-Stop Signatures
).
Springer-Verlag Lecture Notes in Computer Science (Vol. 1100), 1996.
[184] V. Pratt. Every Prime Has a Succinct Certificate.
SIAM Journal on Computing
, Vol. 4,
pages 214-220, 1975.
[185] M.O. Rabin. Probabilistic Algorithm for Testing Primality.
Journal of Number Theory
,
Vol. 12, pages 128-138, 1980.
[186] M.O. Rabin. Digitalized Signatures. In
Foundations of Secure Computation
, R.A. DeMillo
et al., eds. Academic Press, 1977.
[187] M.O. Rabin. Digitalized Signatures and Public Key Functions as Intractable as Factoring.
TR-212, LCS, MIT, Cambridge, MA, 1979.
[188] M.O. Rabin. How to Exchange Secrets by Oblivious Transfer. Tech. Memo. TR-81, Aiken
Computation Laboratory, Harvard University, 1981.
[189] R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge
Proofs. In
EuroCrypt99
, Springer-Verlag Lecture Notes in Computer Science (Vol. 1592),
pages 415- 413, 1999.
[190] R. Raz. A Parallel Repetition Theorem.
SIAM Journal on Computing
, Vol. 27, No. 3,
pages 763-803, 1998.
[191] R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and
Public Key Cryptosystems.
CACM
, Vol. 21, pages 120-126, 1978.
[192] J. Rompel. One-Way Functions Are Necessary and Sufficient for Secure Signatures. In
22nd ACM Symposium on the Theory of Computing
, pages 387-394, 1990.
[193] A. Sahai. Non-Malleable Non-Interactive Zero Knowledge and Achieving Chosen-
Ciphertext Security. In
40th IEEE Symposium on Foundations of Computer Science
,
pages 543-553, 1999.
[194] A. Sahai and S. Vadhan. A Complete Promise Problem for Statistical Zero-Knowledge.
In
38th IEEE Symposium on Foundations of Computer Science
, pages 448-457, 1997.
[195] C.P. Schnorr and H.H. Horner. Attacking the Chor-Rivest Cryptosystem by Improved
Lattice Reduction. In
EuroCrypt95
, Springer-Verlag Lecture Notes in Computer Science
(Vol. 921), pages 1-12, 1995.
[196] A. Shamir. How to Share a Secret.
CACM
, Vol. 22, pages 612-613, 1979.
[197] A. Shamir. A Polynomial-Time Algorithm for Breaking the Merkle-Hellman Cryptosys-
tem. In
23rd IEEE Symposium on Foundations of Computer Science
, pages 145-152, 1982.
[198] A. Shamir. IP
=
PSPACE.
Journal of the ACM
, Vol. 39, No. 4, pages 869-877, 1992.
[199] A. Shamir, R.L. Rivest, and L. Adleman. Mental Poker. Report TM-125, LCS, MIT,
Cambridge, MA, 1979.
[200] C.E. Shannon. Communication Theory of Secrecy Systems.
Bell Systems Technical Jour-
nal
, Vol. 28, pages 656 -715, 1949.
[201] M. Sipser. A Complexity Theoretic Approach to Randomness. In
15th ACM Symposium
on the Theory of Computing
, pages 330-335, 1983.
[202] M. Sipser.
Introduction to the Theory of Computation
. PWS Publishing, Boston, MA,
1997.
