Next: 4. Алгоритмические проблемы теории
Up: Введение в криптографию
Previous: 3.8. Вместо заключения
Contents: Содержание
1
Schnorr C. P. Efficient identification and signatures
for smart cards // Proc. Crypto'89, Lect. Notes in
Comput. Sci. V. 435, 1990. P. 239-252.
2
Goldreich O., Krawczyk H. On the composition of
zero-knowledge proof systems // SIAM J. Comput. V.
25, No 1, 1996. P. 169-192.
3
Goldwasser S., Micali S., Rivest R. A secure
digital signature scheme // SIAM J. Comput. V.
17, No 2, 1988. P. 281-308.
4
Naor M., Yung M. Universal one-way hash functions and
their cryptographic applications // Proc. 21st Annu. ACM
Symp. on Theory of Computing. 1989. P. 33-43.
5
Rompel J. One-way functions are necessary and
sufficient for secure signatures // Proc. 22nd Annu. ACM
Symp. on Theory of Computing. 1990. P. 387-394.
6
Fiat A., Shamir A. How to prove yourself:
practical solutions to identification and signature
problems // Proc. Crypto'86, Lect. Notes in Comput. Sci.
V. 263, 1987. P. 186-194.
7
Feige U., Fiat A., Shamir A. Zero-knowledge proofs of
identity // J. of Cryptology, V. 1, No 2, 1988. P.
77-94.
8
Варновский Н. П. О стойкости схем электронной подписи с
аппаратной поддержкой. Технический отчет. Лаборатория МГУ
по математическим проблемам криптографии, 1997.
9
Chaum D. Online cash checks // Proc.
EUROCRYPT'89, Lect. Notes in Comput. Sci., V. 434,
1990. P. 288-293.
10
Yacobi Y. Efficient electronic money // Proc.
ASIACRYPT'94, Lect. Notes in Comput. Sci., V. 739,
1994. P. 131-139.
11
Brands S. Untraceable off-line cash in wallets with
observers // Proc. Crypto'93, Lect. Notes in Comput.
Sci., V. 773, 1994. P. 302-318.
12
Анохин М. И., Варновский Н. П.,
Сидельников В. М., Ященко В. В. Криптография в
банковском деле. М.: МИФИ, 1997.
13
Chaum D., Pedersen T. P. Transferred cash grows in
size // Proc. EUROCRYPT'92, Lect. Notes in Comput. Sci.,
V. 658, 1993. P. 390-407.
14
Blum M. Coin flipping by telephone: A protocol
for solving impossible problems // Proc. 24th IEEE Comp.
Conf., 1982. P. 133-137; reprinted in SIGACT
News, V. 15, No 1, 1983. P. 23-27.
15
Bellare M., Micali S., Ostrovsky R. Perfect
zero-knowledge in constant rounds // Proc. 22nd Annu. ACM
Symp. on Theory of Computing. 1990. P. 482-493.
16
Kersten A. G. Shared secret Schemes aus geometrisches
sicht. Mitteilungen mathem. Seminar Giessen, Heft 208,
1992.
17
Feldman P. A practical scheme for non-interactive
verifiable secret sharing // Proc. 28th Annu. Symp. on
Found. of Comput. Sci. 1987. P. 427-437.
18
Rabin T., Ben-Or M. Verifiable secret sharing and
multiparty protocols with honest majority // Proc. 21st
Annu. ACM Symp. on Theory of Computing. 1989. P. 73-85.
19
Goldwasser S., Micali S. Probabilistic
encryption // J. of Computer and System Sciences, V.
28, No 2, 1984. P. 270-299.
20
El Gamal T. A public-key cryptosystem and a signature
scheme based on discrete logarithms // IEEE Trans. Inf.
Theory, IT-31, No 4, 1985. P. 469-472.
21
Chaum D., Pedersen T. P. Wallet databases with
observers // Proc. Crypto'92, Lect. Notes in Comput. Sci.,
V. 740, 1993. P. 89-105.
22
Cramer R., Gennaro R., Schoenmakers B. A secure and
optimally efficient multi-authority election scheme //
Proc. EUROCRYPT'97, Lect. Notes in Comput. Sci., V.
1233, 1997. P. 103-118.
23
Cramer R., Franklin M., Schoenmakers B., Yung M.
Multi-authority secret ballot elections with linear work //
Proc. EUROCRYPT'96, Lect. Notes in Comput. Sci., V.
1070, 1996. P. 72-83.
24
Dolev D., Dwork C., Waarts O., Yung M. Perfectly
secure message transmission // Proc. 31st Annu. Symp. on
Found. of Comput. Sci. 1990. P. 36-45.
|
