Secure data structures based on multi-party computation

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 291-292

  Toft, Tomas ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

reactive functionalities; secure multi party computation

Indexed keywords

ACCESS PATTERNS; GENERIC SOLUTIONS; MEMORY LOCATIONS; MULTIPARTY COMPUTATION; PRIORITY QUEUES; RANDOM BITS; REACTIVE FUNCTIONALITY; SECURE MULTI-PARTY COMPUTATION;

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; ENGINEERING RESEARCH; INFORMATION THEORY; MODEL PREDICTIVE CONTROL;

RANDOM ACCESS STORAGE;

EID: 79959864414     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993859     Document Type: Conference Paper

References (15)

1. M. Ajtai. Oblivious rams without cryptogrpahic assumptions. In STOC, 2010.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In STOC, 1988.
3. G. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In SWAT, 2004.
4. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In STOC, 1988.
5. R. Cramer, I. Damgård, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In Eurocrypt, 2001.
6. I. Damgård, S. Meldgaard, and J. B. Nielsen. Perfectly secure oblivious ram without random oracles. In Theory of Cryptography, 2011.
7. I. Damgård and J. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In Crypto, 2003.
8. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In STOC, 1987.
9. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, 43(3):431-473, 1996.
10. T. Nishide and K. Ohta. Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In PKC, 2007.
11. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Eurocrypt, 1999.
12. B. Pinkas and T. Reinman. Oblivious RAM revisited. In Crypto, 2010.
13. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
14. T. Toft. Secure datastructures based on multiparty computation. Cryptology ePrint Archive, Report 2011/081, 2011. http://eprint.iacr.org/.
15. A. Yao. Protocols for secure computations (extended abstract). In FOCS, 1982.