Cryptography Reference
In-Depth Information
[114] J. Rompel, “One-way functions are necessary and sucient for secure signa-
tures,” in
22nd ACM Symposium on the Theory of Computing
, pp. 387-394,
1990.
[115] A. Sahai and S. Vadhan, “A complete promise problem for statistical zero-
knowledge,”
Journal of the ACM
, vol. 50(2), pp. 1-54, 2003.
[116] A. D. Santis, G. D. Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai,
Robust
non-interactive zero-knowledge
. Vol. 2139, Springer-Verlag, 2001.
Crypto01
Lecture Notes in Computer Science.
[117] A. Shamir, “How to share a secret,”
Journal of the ACM
, vol. 22, pp. 612-613,
1979.
[118] A. Shamir, “Ip =pspace,”
Journal of the ACM
, vol. 39(4), pp. 869-877, 1992.
Preliminary version in
31st FOCS
, 1990.
[119] C. Shannon, “Communication theory of secrecy systems,”
Bell System Tech-
nical Journal
, vol. 28, pp. 656-715, 1983.
[120] M. Sipser, “A complexity theoretic approach to randomness,” in
15th ACM
Symposium on the Theory of Computing
, pp. 330-335, 1983.
[121] S.
Vadhan,
A
Study
of
Statistical
Zero-Knowledge
Proofs
.
hD
thesis,
Department
of
Mathematics,
MIT,
1999.
Available
from
http://www.eecs.harvard.edu/ salil/papers/phdthesis-abs.html
.
[122] S. Vadhan, “An unconditional study of computational zero knowledge,” in
45th IEEE Symposium on Foundations of Computer Science
, pp. 176-185,
2004.
[123] A. Yao, “Theory and application of trapdoor functions,” in
23rd IEEE Sym-
posium on Foundations of Computer Science
, pp. 80-91, 1982.
[124] A. Yao, “How to generate and exchange secrets,” in
27th IEEE Symposium
on Foundations of Computer Science
, pp. 162-167, 1986.