[ACM Press the eleventh annual ACM symposium - Atlanta, Georgia, United States (1979.04.30-1979.05.02)] Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79 - The complexity of finding periods
- 作者Sedgewick, Robert; Szymanski, Thomas G.
- 文件大小541.10KB
- 发表时间1979
- DOI10.1145/800135.804400
- 页码74-80
Lower Bounds and Impossibility Results forYehuda Lindell · 2008
General Composition and Universal Composability inYehuda Lindell · 2009
Impossibility Results for Universal Composability inDafna Kidron; Yehuda Lindell · 2011
Secure Computation Without AuthenticationBoaz Barak; Ran Canetti; Yehuda Lindell; Rafael Pass; Tal Rabin · 2011
More Efficient Oblivious Transfer ExtensionsAsharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael · Journal of Cryptology · 2017
A Statistical Theory for Quantitative Association RulesYonatan Aumann; Yehuda Lindell · 2003
Handling Expected Polynomial-Time Strategies inJonathan Katz; Yehuda Lindell · 2008
On the Feasibility of Extending Oblivious TransferLindell, Yehuda; Zarosim, Hila · Journal of Cryptology · 2017