Cryptography Reference
In-Depth Information
[16] M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations Among Notions of
Security for Public-Key Encryption Schemes. In
Crypto98
, Springer-Verlag Lecture Notes
in Computer Science (Vol. 1462), pages 26-45, 1998.
[17] M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. In
Crypto92
, Springer-
Verlag Lecture Notes in Computer Science (Vol. 740), pages 390-420, 1992.
[18] M. Bellare, S. Halevi, A. Sahai, and S. Vadhan. Trapdoor Functions and Public-Key Cry-
ptosystems. In
Crypto98
, Springer-Verlag Lecture Notes in Computer Science (Vol. 1462),
pages 283-298, 1998.
[19] M. Bellare, R. Impagliazzo, and M. Naor. Does Parallel Repetition Lower the Error in
Computationally Sound Protocols? In
38th IEEE Symposium on Foundations of Computer
Science
, pages 374-383, 1997.
[20] M. Bellare and S. Micali. How to Sign Given Any Trapdoor Function.
Journal of the ACM
,
Vol. 39, pages 214-233, 1992.
[21] M. Bellare and P. Rogaway. Random Oracles Are Practical: A Paradigm for Designing
Efficient Protocols. In
1st Conference on Computer and Communications Security
, ACM,
pages 62-73, 1993.
[22] M. Bellare and P. Rogaway. The Exact Security of Digital Signatures: How to Sign with
RSA and Rabin. In
EuroCrypt96
, Springer-Verlag Lecture Notes in Computer Science
(Vol. 1070), pp. 399-416, 1996.
[23] M. Bellare and M. Yung. Certifying Permutations: Noninteractive Zero-Knowledge Based
on Any Trapdoor Permutation.
Journal of Cryptology
, Vol. 9, pages 149-166, 1996.
[24] S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the Theory of Average Case
Complexity.
Journal of Computer and System Science
, Vol. 44, No. 2, April, pages 193-
219, 1992.
[25] M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali, and P. Rogaway.
Everything Provable Is Probable in Zero-Knowledge. In
Crypto88
, Springer-Verlag Lec-
ture Notes in Computer Science (Vol. 403), pages 37-56, 1990.
[26] M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs:
How to Remove Intractability. In
20th ACM Symposium on the Theory of Computing
,
pages 113-131, 1988.
[27] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-
Cryptographic Fault-Tolerant Distributed Computation. In
20th ACM Symposium on the
Theory of Computing
, pages 1-10, 1988.
[28] E.R. Berlekamp. Factoring Polynomials over Large Finite Fields.
Mathematics of Com-
putation
, Vol. 24, pages 713-735, 1970.
[29] E.R. Berlekamp, R.J. McEliece, and H.C.A. van Tilborg. On the Inherent Intractability of
Certain Coding Problems.
IEEE Transactions on Information Theory
, 1978.
[30] M. Blum. How to Exchange Secret Keys.
ACM Trans. Comput. Sys.
, Vol. 1, pages 175-193,
1983.
[31] M. Blum. Coin Flipping by Phone. In
24th IEEE Computer Conference
(
CompCon
),
February, pages 133-137, 1982. (See also
SIGACT News
, Vol. 15, No. 1, 1983.)
[32] L. Blum, M. Blum, and M. Shub. A Simple Secure Unpredictable Pseudo-Random Number
Generator.
SIAM Journal on Computing
, Vol. 15, pages 364-383, 1986.
[33] M. Blum, A. De Santis, S. Micali, and G. Persiano. Non-interactive Zero-Knowledge
Proof Systems.
SIAM Journal on Computing
, Vol. 20, No. 6, pages 1084-1118, 1991.
(Considered the journal version of [34].)
[34] M. Blum, P. Feldman, and S. Micali. Non-Interactive Zero-Knowledge and Its Applica-
tions. In
20th ACM Symposium on the Theory of Computing
, pages 103-112, 1988. (See
[33].)
[35] M. Blum and S. Goldwasser. An Efficient Probabilistic Public-Key Encryption Scheme
