Oblivious data structures: applications to cryptography
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[3] Cecilia R. Aragon,et al. Randomized search trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.
[5] Martin Wirsing,et al. Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[6] A. Andersson,et al. Faster uniquely represented dictionaries , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[7] Birgit Pfitzmann,et al. How To Break and Repair A "Provably Secure" Untraceable Payment System , 1991, CRYPTO.
[8] Mihir Bellare,et al. Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.
[9] Mihir Bellare,et al. Incremental cryptography and application to virus protection , 1995, STOC '95.