skip to main content
research-article

Secure Selections on Encrypted Multi-writer Streams

Published:23 November 2021Publication History
Skip Abstract Section

Abstract

Performing searches over encrypted data is a very current and active area. Several efficient solutions have been provided for the single-writer scenario in which all sensitive data originate with one party (the Data Owner) that encrypts and uploads the data to a public repository. Subsequently, the Data Owner accesses the encrypted data through a Query Processor, which has direct access to the public encrypted repository. Motivated by the recent trend in pervasive data collection, we depart from this model and consider a multi-writer scenario in which the data originate with several and mutually untrusted parties, the Data Sources. In this new scenario, the Data Owner provides public parameters so that each Data Source can add encrypted items to the public encrypted stream; moreover, the Data Owner keeps some related secret information needed to generate tokens so that different Query Sources can decrypt different subsets of the encrypted stream, as specified by corresponding access policies.

We propose security model for this problem that we call Secure Selective Stream (SSS) and give a secure construction for it based on hard problems in Pairing-Based Cryptography. The cryptographic core of our construction is a new primitive, Amortized Orthogonality Encryption, that is crucial for the efficiency of the proposed implementation for SSS.

REFERENCES

  1. Abdalla Michel, Bourse Florian, Caro Angelo De, and Pointcheval David. 2015. Simple functional encryption schemes for inner products. In Proceedings of the 18th IACR International Conference on Practice and Theory in Public-Key Cryptography (PKC’15)Lecture Notes in Computer Science, Katz Jonathan (Ed.), Vol. 9020. Springer, 733751.Google ScholarGoogle ScholarCross RefCross Ref
  2. Barreto Paulo S. L. M. and Naehrig Michael. 2005. Pairing-friendly elliptic curves of prime order. In Proceedings of the 12th International Workshop, Selected Areas in Cryptography (SAC’05), Revised Selected Papers,Lecture Notes in Computer Science, Preneel Bart and Tavares Stafford E. (Eds.), Vol. 3897. Springer, 319331. DOI: DOI: https://doi.org/10.1007/11693383_22 Google ScholarGoogle ScholarCross RefCross Ref
  3. Boneh Dan, Boyen Xavier, and Shacham Hovav. 2004a. Short group signatures. In Proceedings of the 24th Annual International Cryptology Conference (CRYPTO’04),Lecture Notes in Computer Science, Franklin Matthew K. (Ed.), Vol. 3152. Springer, 4155.Google ScholarGoogle ScholarCross RefCross Ref
  4. Boneh Dan, Crescenzo Giovanni Di, Ostrovsky Rafail, and Persiano Giuseppe. 2004b. Public key encryption with keyword search. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Technique (EUROCRYPT’04), Cachin Christian and Camenisch Jan L. (Eds.). Springer, Berlin, 506522.Google ScholarGoogle ScholarCross RefCross Ref
  5. Boneh Dan and Franklin Matthew K.. 2003. Identity-based encryption from the weil pairing. SIAM J. Comput. 32, 3 (2003), 586615. DOI: DOI: https://doi.org/10.1137/S0097539701398521 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Boneh Dan, Sahai Amit, and Waters Brent. 2012. Functional encryption: A new vision for public-key cryptography. Commun. ACM 55, 11 (2012), 5664. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cash David, Jarecki Stanislaw, Jutla Charanjit S., Krawczyk Hugo, Rosu Marcel-Catalin, and Steiner Michael. 2013. Highly-scalable searchable symmetric encryption with support for boolean queries. In Proceedings of the 33rd Annual International Cryptology Conference, Part I, Lecture Notes in Computer Science, Canetti Ran and Garay Juan A. (Eds.), Vol. 8042. Springer, 353373.Google ScholarGoogle ScholarCross RefCross Ref
  8. Curtmola Reza, Garay Juan A., Kamara Seny, and Ostrovsky Rafail. 2011. Searchable symmetric encryption: Improved definitions and efficient constructions. J. Comput. Secur. 19, 5 (2011), 895934. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Eagle Nathan and Pentland Alex. 2006. Reality mining: Sensing complex social systems. Pers. Ubiq. Comput. 10, 4 (2006), 255268. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Garg Sanjam, Gentry Craig, Halevi Shai, Raykova Mariana, Sahai Amit, and Waters Brent. 2016. Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45, 3 (2016), 882929.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Ion Mihaela, Russello Giovanni, and Crispo Bruno. 2010. Providing confidentiality in content-based publish/subscribe systems. In Proceedings of the International Conference on Security and Cryptography (SECRYPT’10), Katsikas Sokratis K. and Samarati Pierangela (Eds.). SciTePress, 287292.Google ScholarGoogle Scholar
  12. Jarecki Stanislaw, Jutla Charanjit S., Krawczyk Hugo, Rosu Marcel-Catalin, and Steiner Michael. 2013. Outsourced symmetric private information retrieval. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS’13), Sadeghi Ahmad-Reza, Gligor Virgil D., and Yung Moti (Eds.). ACM, 875888. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Kamara Seny and Moataz Tarik. 2017. Boolean searchable symmetric encryption with worst-case sub-linear complexity. In Proceedings of the 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’17), Part III, Lecture Notes in Computer Science, Coron Jean-Sébastien and Nielsen Jesper Buus (Eds.), Vol. 10212. 94124. DOI: DOI: https://doi.org/10.1007/978-3-319-56617-7_4Google ScholarGoogle ScholarCross RefCross Ref
  14. Kamara Seny and Moataz Tarik. 2018. SQL on structurally-encrypted databases. In Proceedings of the 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane (ASIACRYPT’18), Part I, Lecture Notes in Computer Science, Peyrin Thomas and Galbraith Steven D. (Eds.), Vol. 11272. Springer, 149180.Google ScholarGoogle ScholarCross RefCross Ref
  15. Katz Jonathan, Sahai Amit, and Waters Brent. 2013. Predicate encryption supporting disjunctions, polynomial equations, and inner products. J. Cryptol. 26, 2 (2013), 191224. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Lewko Allison B., Okamoto Tatsuaki, Sahai Amit, Takashima Katsuyuki, and Waters Brent. 2010. Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’10),Lecture Notes in Computer Science, Gilbert Henri (Ed.), Vol. 6110. Springer, 6291. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Naveed Muhammad, Kamara Seny, and Wright Charles V.. 2015. Inference attacks on property-preserving encrypted databases. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Ray Indrajit, Li Ninghui, and Kruegel Christopher (Eds.). ACM, 644655. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Nikander Pekka and Marias Giannis F.. 2008. Towards understanding pure publish/subscribe cryptographic protocols. In Proceedings of the 16th International Workshop on Security Protocols (Security Protocols XVI). Revised Selected PapersLecture Notes in Computer Science, Christianson Bruce, Malcolm James A., Matyas Vashek, and Roe Michael (Eds.), Vol. 6615. Springer, 144155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Okamoto Tatsuaki and Takashima Katsuyuki. 2015. Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. Des. Codes Cryptogr. 77, 2–3 (2015), 725771. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Okamoto Tatsuaki and Takashima Katsuyuki. 2016. Adaptively attribute-hiding (hierarchical) inner product encryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A, 1 (2016), 92117.Google ScholarGoogle ScholarCross RefCross Ref
  21. O’Neill Adam. 2010. Definitional issues in functional encryption. IACR Cryptol. ePrint Arch. (2010), 556.Google ScholarGoogle Scholar
  22. Pal Partha P., Lauer Greg, Khoury Joud, Hoff Nick, and Loyall Joseph P.. 2012. P3S: A privacy preserving publish-subscribe middleware. In Proceedings of the ACM/IFIP/USENIX 13th International Middleware Conference (Middleware’12),Lecture Notes in Computer Science, Narasimhan Priya and Triantafillou Peter (Eds.), Vol. 7662. Springer, 476495. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Park Jong Hwan. 2011. Inner-product encryption under standard assumptions. Des. Codes Cryptogr. 58, 3 (2011), 235257. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Patel Sarvar, Persiano Giuseppe, and Yeo Kevin. 2018. Symmetric searchable encryption with sharing and unsharing. In Proceedings of the 23rd European Symposium on Research in Computer Security (ESORICS’18), Part II, Lecture Notes in Computer Science, López Javier, Zhou Jianying, and Soriano Miguel (Eds.), Vol. 11099. Springer, 207227.Google ScholarGoogle ScholarCross RefCross Ref
  25. Perillo Angelo Massimo, Persiano Giuseppe, and Trombetta Alberto. 2017. Secure queries on encrypted multi-writer tables. In Proceedings of the IEEE European Symposium on Security and Privacy (EuroS&P’17). IEEE, 127141.Google ScholarGoogle ScholarCross RefCross Ref
  26. Popa Raluca A., Redfield Catherine M. S., Zeldovich Nickolai, and Balakrishnan Hari. 2011. CryptDB: Protecting confidentiality with encrypted query processing. In Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP’11), Wobber Ted and Druschel Peter (Eds.). ACM, 85100. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Sakemi Yumi, Kobayashi Tetsutaro, Saito Tsunekazu, and Wahby Riad S.. 2020. Pairing-Friendly Curves. Internet-Draft draft-irtf-cfrg-pairing-friendly-curves-09. Internet Engineering Task Force. Retrieved from https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-pairing-friendly-curves-09.Google ScholarGoogle Scholar
  28. Shen Emily, Shi Elaine, and Waters Brent. 2009. Predicate privacy in encryption systems. In Proceedings of the 6th Theory of Cryptography (TCC’09),Lecture Notes in Computer Science, Reingold Omer (Ed.), Vol. 5444. Springer, 457473. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Song D., Wagner D., and Perrig A.. 2000. Practical techniques for searches on encrypted data. In Proceeding of the IEEE Symposium on Security and Privacy (S&P’00). 4455.Google ScholarGoogle Scholar

Index Terms

  1. Secure Selections on Encrypted Multi-writer Streams

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Privacy and Security
      ACM Transactions on Privacy and Security  Volume 25, Issue 1
      February 2022
      219 pages
      ISSN:2471-2566
      EISSN:2471-2574
      DOI:10.1145/3485162
      Issue’s Table of Contents

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 23 November 2021
      • Accepted: 1 September 2021
      • Revised: 1 April 2021
      • Received: 1 October 2019
      Published in tops Volume 25, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Refereed
    • Article Metrics

      • Downloads (Last 12 months)75
      • Downloads (Last 6 weeks)3

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    View Full Text

    HTML Format

    View this article in HTML Format .

    View HTML Format
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!