Daniele Micciancio
- 1.M. Bellare, O. Gotdreich and S. Goldwasser, "Incremental Cryptography and Application to Virus Protection", Proc. of the 27th Ann. ACM Symp. on the Theoo' of Computing. 1995, pp 45-56. Google Scholar
Digital Library
- 2.M. Bellare, O. Goldreich and S. Goldwasser, "Incremental Cryptography: The case of Hashing and Signing", Advances in cryptology. Proceedingsof the 14th Ann. International Conference, pp 216-233.1994 Springer-Verlag, LNCS 839. Google ScholarDigital Library
- 3.W. Pugh, "Skip Lists: A Probabilistic Alternative to Balanced Trees", Univ. of Mar>,Iand, Tech. Report CS-TR-2190. 1989.Google Scholar
- 4.C. R. Aragon and R. G. Seidel, "Randomized Search Trees", Proc. of the 30th Ann. IEEE Syrup. on Foundations of Computer Science. 1983. pp 540-545.Google Scholar
- 5.A. Aho, J. Hopcroft and J. Ullman, "The design and analysis of computer algorithms", Addison Wesley, 1974. Google ScholarDigital Library
- 6.M. Wirsing, "Algebraic Specification", in Handbook of Theoretical Computer Science. Edited by J. van Leeuwen. Elsevier 1990. Vol. B, Chapter 13, pp 677-788. Google ScholarDigital Library
- 7.S. Goldwasser, S. Micali and R. L. Rivest, "A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks", SiAM Journal of Computing, 17(2), 1988, pp. 281- 308. Google ScholarDigital Library
- 8.B. Pfitzmann and M. Waidner, "How to Break and Repair a Provably Secure Untraceable Payment System", Advances in Cryptology: Proceedings of the llth Ann. International Conference. 1991, LNCS 576, Springer-Vefiag. pp. 338-350. Google ScholarDigital Library
- 9.A. Andersson and T Ottmann, "Faster Uniquely Represented Dictionaries", Proc. of the 38th Ann. IEEE Syrup. on Foundations of Computer Science. 1991. pp.642-649. Google ScholarDigital Library
Index Terms
- Oblivious data structures: applications to cryptography
Recommendations
Oblivious Data Structures
CCS '14: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications SecurityWe design novel, asymptotically more efficient data structures and algorithms for programs whose data access patterns exhibit some degree of predictability. To this end, we propose two novel techniques, a pointer-based technique and a locality-based ...
Lower bounds for oblivious data structures
SODA '19: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete AlgorithmsAn oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced by Wang et al. [ACM SIGSAC'14] and are intended for situations where one ...
Comments