Cryptography Reference
In-Depth Information
[76] U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs
under General Assumptions.
SIAM Journal on Computing
, Vol. 29, No. 1, pages 1-28,
1999.
[77] U. Feige and A. Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. In
Crypto89
, Springer-Verlag Lecture Notes in Computer Science (Vol. 435), pages 526-
544, 1990.
[78] U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In
22nd ACM Symposium on the Theory of Computing
, pages 416-426, 1990.
[79] W. Feller.
An Introduction to Probability Theory and Its Applications
. Wiley, New York,
1968.
[80] A. Fiat and A. Shamir. How to Prove Yourself: Practical Solution to Identification and
Signature Problems. In
Crypto86
, Springer-Verlag Lecture Notes in Computer Science
(Vol. 263), pages 186-189, 1987.
[81] M. Fischer, S. Micali, C. Rackoff, and D.K. Wittenberg. An Oblivious Transfer Protocol
Equivalent to Factoring. Unpublished manuscript, 1986. (Preliminary versions were pre-
sented in
EuroCrypt84
and in the
NSF Workshop on Mathematical Theory of Security
,
Endicott House (1985).)
[82] R. Fischlin and C.P. Schnorr. Stronger Security Proofs for RSA and Rabin Bits. In
EuroCrypt97
, Springer-Verlag Lecture Notes in Computer Science (Vol. 1233), pages
267-279, 1997.
[83] L. Fortnow. The Complexity of Perfect Zero-Knowledge. In
19th ACM Symposium on the
Theory of Computing
, pages 204-209, 1987.
[84] A.M. Frieze, J. Hastad, R. Kannan, J.C. Lagarias, and A. Shamir. Reconstructing Truncated
Integer Variables Satisfying Linear Congruences.
SIAM Journal on Computing
, Vol. 17,
pages 262-280, 1988.
[85] O. Gaber and Z. Galil. Explicit Constructions of Linear Size Superconcentrators.
Journal
of Computer and System Science
, Vol. 22, pages 407-420, 1981.
[86] M.R. Garey and D.S. Johnson.
Computers and Intractability: A Guide to the Theory of
NP-Completeness
. Freeman, San Francisco, 1979.
[87] P.S. Gemmell. An Introduction to Threshold Cryptography. In
CryptoBytes
(RSA Labo-
ratories), Vol. 2, No. 3, 1997.
[88] R. Gennaro and L. Trevisan. Lower Bounds on the Efficiency of Generic Cryptographic
Constructions.
ECCC
, TR00-022, May 2000.
[89] O. Goldreich. Two Remarks Concerning the GMR Signature Scheme. In
Crypto86
,
Springer-Verlag
Lecture
Notes
in
Computer
Science
(Vol.
263),
pages
104-110,
1987.
[90] O. Goldreich. Towards a Theory of Software Protection and Simulation by Oblivious
RAMs. In
19th ACM Symposium on the Theory of Computing
, pages 182-194, 1987.
[91] O. Goldreich.
Foundation of Cryptography - Class Notes
. Preprint, spring 1989. (Super-
seded by the current topic in conjunction with [92].)
[92] O. Goldreich.
Lecture Notes on Encryption, Signatures and Cryptographic Protocol
.
(Extracts from [91]. Available from
http://theory.lcs.mit.edu/
∼
oded/
ln89.html.
Superseded by the combination of [99], [100], and [98].)
[93] O. Goldreich. A Note on Computational Indistinguishability.
Information Processing Let-
ters
, Vol. 34, May, pages 277-281, 1990.
[94] O. Goldreich. A Uniform Complexity Treatment of Encryption and Zero-Knowledge.
Journal of Cryptology
, Vol. 6, No. 1, pages 21-53, 1993.
[95] O. Goldreich.
Foundation of Cryptography - Fragments of a Topic
. February 1995. (Avail-
able from
http://theory.lcs.mit.edu/
∼
oded/frag.html.
Superseded by the
current topic in conjunction with [99].)
