SIGN IN
SIGN UP
Private coins versus public coins in interactive proof systems
Full Text:
PDF
Buy this Article
Authors:
S Goldwasser
Computer Science Department, MIT
M Sipser
Computer Science Department, University of California at Berkeley and Mathematics Department, MIT
Published in:
· Proceeding
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Pages 59-68
ACM
New York, NY
, USA
©1986
table of contents
ISBN:0-89791-193-8
doi>
10.1145/12130.12137
1986 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 32
· Downloads (cumulative): 675
· Citation Count: 62
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
bounded-action devices
reducibility and completeness
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder