Cryptography Reference

In-Depth Information

[78] O. Goldreich, S. Vadhan, and A. Wigderson, “On interactive proofs with a

laconic provers,”
Computational Complexity
, vol. 11, pp. 1-53, 2002.

[79] O. Goldreich and R. Vainish,
How to solve any protocol problem - an e
ciency

improvement
. Vol. 293, Springer-Verlag, 1988.
Crypto87
Lecture Notes in

Computer Science.

[80] S. Goldwasser and S. Micali, “Probabilistic encryption,”
Journal of Computer

and System Science
, vol. 28(2), pp. 270-299, 1984. Preliminary version in
14th

STOC
, 1982.

[81] S. Goldwasser, S. Micali, and C. Rackoff, “The knowledge complexity of inter-

active proof systems,”
SIAM Journal on Computing
, vol. 18, pp. 186-208,

1989. Preliminary version in
17th STOC
, 1985.

[82] S. Goldwasser, S. Micali, and R. Rivest, “A digital signature scheme secure

against adaptive chosen-message attacks,”
SIAM Journal on Computing
,

pp. 281-308, 1988.

[83] S. Golomb,
Shift Register Sequences
. Aegean Park Press, revised edition ed.,

1982. Holden-Dat, 1967.

[84] R. Greenstadt, “Electronic voting bibliography,” 2000.

http://theory.lcs.mit.edu/ cis/voting/greenstadt-voting-bibligraphy.html.

[85] J. H astad, R. Impagliazzo, L. Levin, and M. Luby, “A pseudorandom gener-

ator from any one-way function,”
SIAM Journal on Computing
, vol. 28(4),

pp. 1364-1396, 1999.

[86] M. Hirt and U. Maurer, “Complete characterization of adversaries tolerable in

secure multi-party computation,”
Journal of Cryptology
, vol. 13(1), pp. 31-60,

2000.

[87] R. Impagliazzo, L. Levin, and M. Luby, “Pseudorandom generation from one-

way functions,” in
21st ACM Symposium on the Theory of Computing
, pp. 12-

24, 1989.

[88] R. Impagliazzo and M. Yung,
Direct zero-knowledge computations
. Vol. 293,

Springer-Verlag, 1987.
Crypto87
Lecture Notes in Computer Science.

[89] J. Katz and M. Yung, “Complete characterization of security notions for prob-

abilistic private-key encryption,” in
32nd ACM Symposium on the Theory of

Computing
, pp. 245-254, 2000.

[90] J. Kilian, “A note on ecient zero-knowledge proofs and arguments,” in
24th

ACM Symposium on the Theory of Computing
, pp. 723-732, 1992.

[91] J. Kilian and E. Petrank, “Concurrent and resettable zero-knowledge in poly-

logarithmic rounds,” in
33rd ACM Symposium on the Theory of Computing
,

pp. 560-569, 2001.

[92] D. Knuth,
The Art of Computer Programming
. Vol. 2, Addison-Wesley Pub-

lishing Company Inc, first edition ed., 1969.

[93] H. Krawczyk,
LFSR-based hashing and authentication
. Vol. 839, Springer-

Verlag, 1994.
Crypto94
Lecture Notes in Computer Science.

[94] Y. Lindell,
Parallel coin-tossing and constant-round secure two-party compu-

tation
. Vol. 2139, Springer-Verlag, 2001.
Crypto01
Lecture Notes in Computer

Science.

[95] Y. Lindell, A. Lysyanskaya, and T. Rabin, “On the composition of authen-

ticated byzantine agreement,” in
34th ACM Symposium on the Theory of

Computing
, pp. 514-523, 2002.