How to Update Documents Verifiably in Searchable Symmetric Encryption
- 1 January 2013
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean QueriesLecture Notes in Computer Science, 2013
- Structured Encryption and Controlled DisclosureLecture Notes in Computer Science, 2010
- Searchable symmetric encryptionPublished by Association for Computing Machinery (ACM) ,2006
- Efficient Conjunctive Keyword Search on Encrypted Data Storage SystemLecture Notes in Computer Science, 2006
- Privacy Preserving Keyword Searches on Remote Encrypted DataLecture Notes in Computer Science, 2005
- Achieving Efficient Conjunctive Keyword Searches over Encrypted DataLecture Notes in Computer Science, 2005
- Dynamic Accumulators and Application to Efficient Revocation of Anonymous CredentialsLecture Notes in Computer Science, 2002
- Universally composable security: a new paradigm for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Collision-Free Accumulators and Fail-Stop Signature Schemes Without TreesLecture Notes in Computer Science, 1997
- One-Way Accumulators: A Decentralized Alternative to Digital SignaturesLecture Notes in Computer Science, 1994