Correlated pseudorandomness and the complexity of private computations 论文

1996引用 229
Cryptography and Data SecurityComplexity and Algorithms in Graphsgraph theory and CDMA systems

摘要

Article Free Access Share on Correlated pseudorandomness and the complexity of private computations Author: Donald Beaver Transarc Corp., Gulf Tower, 707 Grant St., Pittsburgh, PA Transarc Corp., Gulf Tower, 707 Grant St., Pittsburgh, PAView Profile Authors Info & Claims STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of ComputingJuly 1996 Pages 479–488https://doi.org/10.1145/237814.237996Online:01 July 1996Publication History 125citation730DownloadsMetricsTotal Citations125Total Downloads730Last 12 Months64Last 6 weeks17 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

相关事件

暂无数据

相关文章

暂无数据