ACM Home Page
Please provide us with feedback. Feedback
Commodity-based cryptography (extended abstract)
Full text PdfPdf (1.33 MB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing table of contents
El Paso, Texas, United States
Pages: 446 - 455  
Year of Publication: 1997
ISBN:0-89791-888-6
Author
Donald Beaver  Transarc Corp., Gulf Tower, 707 Grant St., Pittsburgh, PA
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 42,   Citation Count: 6
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/258533.258637
What is a DOI?

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
BGW88
 
BBS86
 
BC89
 
BCC88
CCD88
 
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
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.