|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
AFK89
|
|
| |
BM88
|
|
| |
BFL90
|
L. Bahai, L. Fortnow, C. Lund. "Non- Deterministic Exponential Time has Two- Prover Interactive Proofs." Proceedings of the 31*t FOC$, IEEE, 1990, 1990, 16-25.
|
| |
B87
|
D. Beaver. "Oblivious Secret Computation." Harvard University TR-12-87, December 1987.
|
| |
B91a
|
D. Beaver. "Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority." J. Cryptology 4:2, 1991, 75-122.
|
| |
B91b
|
|
| |
B91c
|
|
| |
B95
|
|
| |
BF90
|
|
| |
BFKR89
|
|
| |
BS93
|
|
| |
BM89
|
|
| |
BBCS91
|
|
 |
BGKW88
|
Michael Ben-Or , Shafi Goldwasser , Joe Kilian , Avi Widgerson, Multi-prover interactive proofs: how to remove intractability assumptions, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.113-131, May 02-04, 1988, Chicago, Illinois, United States
[doi> 10.1145/62212.62223]
|
 |
BGW88
|
Michael Ben-Or , Shafi Goldwasser , Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.1-10, May 02-04, 1988, Chicago, Illinois, United States
[doi> 10.1145/62212.62213]
|
| |
BBS86
|
|
| |
BC89
|
|
| |
BCC88
|
|
 |
CCD88
|
David Chaum , Claude Crépeau , Ivan Damgard, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.11-19, May 02-04, 1988, Chicago, Illinois, United States
[doi> 10.1145/62212.62214]
|
| |
CGKS95
|
|
| |
C87
|
|
| |
Cr96
|
C. Crdpeau. "Efficient Cryptographic Protocols Based on Noisy Channels." Manuscript, April 9, 1996.
|
| |
CK88
|
C. Crdpeau, J. Kilian. "Achieving Oblivious Transfer Using Weakened Security Assumptions.'' Proceedings of the 29th FOC$, IEEE, 1988, 42-52.
|
 |
DDFY94
|
Alfredo De Santis , Yvo Desmedt , Yair Frankel , Moti Yung, How to share a function securely, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.522-533, May 23-25, 1994, Montreal, Quebec, Canada
[doi> 10.1145/195058.195405]
|
 |
PSL80
|
|
 |
EGL82
|
|
| |
FFS88
|
|
| |
F87
|
P. Feldman. "A Practical Scheme for Noninteractive Verifiable Secret Sharing." Proceedings of the 28th FOCS, IEEE, 1987, 427- 437.
|
| |
FRS88
|
L. Fortnow, J. Rompel, M. Sipser. "On the Power of Multi-Prover Interactive Protocols.'' Proceedings of the 3ra Structure in Complexity Theory Conf., IEEE, 1988, 156- 161.
|
| |
GMR89
|
|
| |
GMW86
|
O. Goldreich, S. Micali, A. Wigderson. "Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design." Proceedings of the 27th FOCS, IEEE, 1986, 1986, 174-187.
|
 |
GMW87
|
|
 |
K88
|
|
| |
LFKN89
|
K. Lund, L. Fortnow, H. Karloff, N. Nisan. "The Polynomial Time Hierarchy has Interactive Proofs." 1989.
|
| |
MR91
|
|
| |
R81
|
M.O. Rabin. "How to Exchange Secrets by Oblivious Transfer." TR-81, Harvard, 1981.
|
| |
R83
|
M.O. Rabin. "Randomized Byzantine Generals.'' Proceedings of the 24th FOCS, IEEE, 1983, 403-409.
|
 |
RB89
|
|
| |
S89
|
A. Shamir. "IP = PSPACE." Proceedings of the 31st FOCS, IEEE, 1990, 11-15.
|
| |
TW87
|
M. Tompa, H. Woll. "Random Self- Reducibility and Zero-Knowledge Proofs of Possession of Information." Proceedings of the 28ta FOCS, IEEE, 1987, 472-482.
|
| |
Y82
|
A. Yao. "Protocols for Secure Computations.'' Proceedings of the 23"a FOCS, IEEE, 1982, 160-164.
|
|