Searchain: Blockchain-based private keyword search in decentralized storage

Abstract Blockchain-based distributed storage enables users to share data without the help of a centralized service provider. Decentralization eliminates traditional data loss brought by compromising the provider, but incurs the possible privacy leakage in a way that the supplier directly links the retrieved data to its ciphertext. Oblivious keyword search (OKS) has been regarded as a solution to this issue. OKS allows a user to retrieve the data associated with a chosen keyword in an oblivious way. That is, the chosen keyword and the corresponding ciphertext are unknown to the data supplier. But if the retrieval privilege is with an authorized keyword set, OKS is unavailable due to one-keyword restriction and public key encryption with keyword search (PEKS) might lead to high bandwidth consumption. In this paper, we introduce Searchain , a blockchain-based keyword search system. It enables oblivious search over an authorized keyword set in the decentralized storage. Searchain is built on top of a novel primitive called oblivious keyword search with authorization (OKSA) , which provides the guarantee of keyword authorization besides oblivious search. We instantiate a provably secure OKSA scheme, featured with one-round interaction and constant size communication cost in the transfer phase. We apply OKSA and ordered multisignatures (OMS) to present a Searchain protocol, which achieves oblivious peer-to-peer retrieval with order-preserving transaction. The analysis and evaluation show that Searchain maintains reasonable cost without loss of retrieval privacy, and hence guarantees its practicality.

[1]  Reza Curtmola,et al.  Provable data possession at untrusted stores , 2007, CCS '07.

[2]  Naoto Yanai,et al.  An Ordered Multisignature Scheme Under the CDH Assumption Without Random Oracles , 2013, ISC.

[3]  Hwajeong Seo,et al.  On Emerging Family of Elliptic Curves to Secure Internet of Things: ECC Comes of Age , 2017, IEEE Transactions on Dependable and Secure Computing.

[4]  Kaoru Kurosawa,et al.  Simple Adaptive Oblivious Transfer without Random Oracle , 2009, ASIACRYPT.

[5]  Kevin J. Peterson,et al.  A Blockchain-Based Approach to Health Information Exchange Networks , 2016 .

[6]  Hugo Krawczyk,et al.  Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..

[7]  N. Rosanov Proof of existence , 2011, Nature Photonics.

[8]  Ghassan O. Karame,et al.  Transparent Data Deduplication in the Cloud , 2015, CCS.

[9]  Abhi Shelat,et al.  Simulatable Adaptive Oblivious Transfer , 2007, EUROCRYPT.

[10]  Brent Waters,et al.  Conjunctive, Subset, and Range Queries on Encrypted Data , 2007, TCC.

[11]  Wen-Guey Tzeng,et al.  Efficient k-out-of-n Oblivious Transfer Schemes , 2005, J. Univers. Comput. Sci..

[12]  Patrick Valduriez,et al.  Principles of Distributed Database Systems , 1990 .

[13]  Hugo Krawczyk,et al.  Outsourced symmetric private information retrieval , 2013, IACR Cryptol. ePrint Arch..

[14]  Mihir Bellare,et al.  Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions , 2005, Journal of Cryptology.

[15]  Dong Hoon Lee,et al.  Oblivious Conjunctive Keyword Search , 2005, WISA.

[16]  Alex Pentland,et al.  Decentralizing Privacy: Using Blockchain to Protect Personal Data , 2015, 2015 IEEE Security and Privacy Workshops.

[17]  Elaine Shi,et al.  Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts , 2016, 2016 IEEE Symposium on Security and Privacy (SP).

[18]  Fuchun Guo,et al.  Subset Membership Encryption and Its Applications to Oblivious Transfer , 2014, IEEE Transactions on Information Forensics and Security.

[19]  Peng Jiang,et al.  Oblivious Keyword Search with Authorization , 2016, ProvSec.

[20]  Matthew Green,et al.  Universally Composable Adaptive Oblivious Transfer , 2008, IACR Cryptol. ePrint Arch..

[21]  Yalin Chen,et al.  A novel k-out-of-n Oblivious Transfer Protocols Based on Bilinear Pairings , 2010, IACR Cryptol. ePrint Arch..

[22]  Kaoru Kurosawa,et al.  Oblivious keyword search , 2004, J. Complex..

[23]  Dong Hoon Lee,et al.  Improved searchable public key encryption with designated tester , 2009, ASIACCS '09.

[24]  Feng Bao,et al.  Oblivious Keyword Search Protocols in the Public Database Model , 2007, 2007 IEEE International Conference on Communications.

[25]  Craig Gentry,et al.  Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing , 2007, CCS '07.

[26]  Chun-I Fan,et al.  Provably Secure Integrated On/Off-Line Electronic Cash for Flexible and Efficient Payment , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[27]  Matthew Green,et al.  Synchronized aggregate signatures: new definitions, constructions and applications , 2010, CCS '10.

[28]  Jan Camenisch,et al.  Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data , 2009, Public Key Cryptography.

[29]  Chuan Qin,et al.  The Design and Implementation of a Rekeying-Aware Encrypted Deduplication Storage System , 2017, ACM Trans. Storage.

[30]  Xiaosong Zhang,et al.  Information Leakage in Encrypted Deduplication via Frequency Analysis , 2017, 2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[31]  Tsuyoshi Takagi,et al.  Efficient Conjunctive Keyword-Searchable Encryption , 2007, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07).

[32]  Gregory Neven,et al.  Efficient Sequential Aggregate Signed Data , 2008, IEEE Transactions on Information Theory.

[33]  Rafail Ostrovsky,et al.  Public Key Encryption with Keyword Search , 2004, EUROCRYPT.

[34]  Jan Camenisch,et al.  Unlinkable Priced Oblivious Transfer with Rechargeable Wallets , 2010, Financial Cryptography.

[35]  Dan Boneh,et al.  Hierarchical Identity Based Encryption with Constant Size Ciphertext , 2005, EUROCRYPT.

[36]  Benny Pinkas,et al.  Keyword Search and Oblivious Pseudorandom Functions , 2005, TCC.

[37]  Danna Zhou,et al.  d. , 1934, Microbial pathogenesis.

[38]  Brent Waters,et al.  New constructions and practical applications for private stream searching , 2006, 2006 IEEE Symposium on Security and Privacy (S&P'06).

[39]  Jan Camenisch,et al.  Oblivious transfer with access control , 2009, IACR Cryptol. ePrint Arch..

[40]  M. Bellare,et al.  Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions , 2008, Journal of Cryptology.

[41]  Dawn Xiaodong Song,et al.  Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[42]  Satoshi Nakamoto Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .

[43]  Michael O. Rabin,et al.  How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..

[44]  Peng Jiang,et al.  Online/Offline Ciphertext Retrieval on Resource Constrained Devices , 2016, Computer/law journal.

[45]  Husen Wang,et al.  Elliptic Curve Cryptography with Efficiently Computable Endomorphisms and Its Hardware Implementations for the Internet of Things , 2017, IEEE Transactions on Computers.

[46]  Yuval Ishai,et al.  Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.