Structured Encryption with Non-interactive Updates and Parallel Traversal

Proceedings - International Conference on Distributed Computing Systems

Volumn 2015-July, Issue , 2015, Pages 776-777

  Lai, Russell W F ^a   Chow, Sherman S M ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

dynamic; Non interactive; parallel; structured encryption; symmetric searchable encryption

Indexed keywords

BINARY TREES; DIGITAL STORAGE; DYNAMICS; SEARCH ENGINES;

BINARY SEARCH TREES; INTERACTIVE QUERIES; NON-INTERACTIVE; PARALLEL; SEARCHABLE ENCRYPTIONS; STORAGE OVERHEAD; STRUCTURED DATA; SYMMETRIC ENCRYPTION;

CRYPTOGRAPHY;

EID: 84944319321     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2015.104     Document Type: Conference Paper

References (11)

1. D. X. Song, D. Wagner, and A. Perrig, "Practical Techniques for Searches on Encrypted Data," in IEEE Symposium on Security and Privacy, pp. 44-55, 2000.
2. E.-J. Goh, "Secure Indexes." Cryptology ePrint Archive, Report 2003/216.
3. Y.-C. Chang and M. Mitzenmacher, "Privacy Preserving Keyword Searches on Remote Encrypted Data," in ACNS, pp. 442-455, 2005.
4. R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, "Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions," Journal of Computer Security, pp. 895-934, 2011.
5. M. Chase and S. Kamara, "Structured Encryption and Controlled Disclosure," in ASIACRYPT, pp. 577-594, 2010.
6. S. Kamara, C. Papamanthou, and T. Roeder, "Dynamic Searchable Symmetric Encryption," in ACM Conference on Computer and Communications Security (CCS), pp. 965-976, 2012.
7. S. Kamara and C. Papamanthou, "Parallel and Dynamic Searchable Symmetric Encryption," in Financial Cryptography, pp. 258-274, 2013.
8. E. Stefanov, C. Papamanthou, and E. Shi, "Practical Dynamic Searchable Encryption with Small Leakage," in NDSS, 2014.
9. D. Cash, S. Jarecki, C. S. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner, "Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries," in CRYPTO, pp. 353-373, 2013.
10. O. Goldreich and R. Ostrovsky, "Software Protection and Simulation on Oblivious RAMs," J. ACM, pp. 431-473, 1996.
11. B. A. Reed, "The Height of a Random Binary Search Tree," J. ACM, vol. 50, no. 3, pp. 306-332, 2003.