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
(
- . 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 , (Ed.), Vol. 9020. Springer, 733–751.Google ScholarCross Ref
- . 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 , and (Eds.), Vol. 3897. Springer, 319–331.DOI: DOI: https://doi.org/10.1007/11693383_22 Google ScholarCross Ref
- . 2004a. Short group signatures. In Proceedings of the 24th Annual International Cryptology Conference (CRYPTO’04),
Lecture Notes in Computer Science , (Ed.), Vol. 3152. Springer, 41–55.Google ScholarCross Ref
- . 2004b. Public key encryption with keyword search. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Technique (EUROCRYPT’04), and (Eds.). Springer, Berlin, 506–522.Google Scholar
Cross Ref
- . 2003. Identity-based encryption from the weil pairing. SIAM J. Comput. 32, 3 (2003), 586–615.
DOI: DOI: https://doi.org/10.1137/S0097539701398521 Google ScholarDigital Library
- . 2012. Functional encryption: A new vision for public-key cryptography. Commun. ACM 55, 11 (2012), 56–64. Google Scholar
Digital Library
- . 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 , and (Eds.), Vol. 8042. Springer, 353–373.Google ScholarCross Ref
- . 2011. Searchable symmetric encryption: Improved definitions and efficient constructions. J. Comput. Secur. 19, 5 (2011), 895–934. Google Scholar
Digital Library
- . 2006. Reality mining: Sensing complex social systems. Pers. Ubiq. Comput. 10, 4 (2006), 255–268. Google Scholar
Digital Library
- . 2016. Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45, 3 (2016), 882–929.Google Scholar
Digital Library
- . 2010. Providing confidentiality in content-based publish/subscribe systems. In Proceedings of the International Conference on Security and Cryptography (SECRYPT’10), and (Eds.). SciTePress, 287–292.Google Scholar
- . 2013. Outsourced symmetric private information retrieval. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS’13), , , and (Eds.). ACM, 875–888. Google Scholar
Digital Library
- . 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 , and (Eds.), Vol. 10212. 94–124.DOI: DOI: https://doi.org/10.1007/978-3-319-56617-7_4Google ScholarCross Ref
- . 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 , and (Eds.), Vol. 11272. Springer, 149–180.Google ScholarCross Ref
- . 2013. Predicate encryption supporting disjunctions, polynomial equations, and inner products. J. Cryptol. 26, 2 (2013), 191–224. Google Scholar
Digital Library
- . 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 , (Ed.), Vol. 6110. Springer, 62–91. Google ScholarDigital Library
- . 2015. Inference attacks on property-preserving encrypted databases. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, , , and (Eds.). ACM, 644–655. Google Scholar
Digital Library
- . 2008. Towards understanding pure publish/subscribe cryptographic protocols. In Proceedings of the 16th International Workshop on Security Protocols (Security Protocols XVI). Revised Selected Papers
Lecture Notes in Computer Science , , , , and (Eds.), Vol. 6615. Springer, 144–155. Google ScholarDigital Library
- . 2015. Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. Des. Codes Cryptogr. 77, 2–3 (2015), 725–771. Google Scholar
Digital Library
- . 2016. Adaptively attribute-hiding (hierarchical) inner product encryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A, 1 (2016), 92–117.Google Scholar
Cross Ref
- . 2010. Definitional issues in functional encryption. IACR Cryptol. ePrint Arch. (2010), 556.Google Scholar
- . 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 , and (Eds.), Vol. 7662. Springer, 476–495. Google ScholarDigital Library
- . 2011. Inner-product encryption under standard assumptions. Des. Codes Cryptogr. 58, 3 (2011), 235–257. Google Scholar
Digital Library
- . 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 , , , and (Eds.), Vol. 11099. Springer, 207–227.Google ScholarCross Ref
- . 2017. Secure queries on encrypted multi-writer tables. In Proceedings of the IEEE European Symposium on Security and Privacy (EuroS&P’17). IEEE, 127–141.Google Scholar
Cross Ref
- . 2011. CryptDB: Protecting confidentiality with encrypted query processing. In Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP’11), and (Eds.). ACM, 85–100. Google Scholar
Digital Library
- . 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 Scholar - . 2009. Predicate privacy in encryption systems. In Proceedings of the 6th Theory of Cryptography (TCC’09),
Lecture Notes in Computer Science , (Ed.), Vol. 5444. Springer, 457–473. Google ScholarDigital Library
- . 2000. Practical techniques for searches on encrypted data. In Proceeding of the IEEE Symposium on Security and Privacy (S&P’00). 44–55.Google Scholar
Index Terms
Secure Selections on Encrypted Multi-writer Streams
Recommendations
Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-...
Delegatable homomorphic encryption with applications to secure outsourcing of computation
CT-RSA'12: Proceedings of the 12th conference on Topics in CryptologyWe propose a new cryptographic primitive called Delegatable Homomorphic Encryption (DHE). This allows a Trusted Authority to control/delegate the evaluation of circuits over encrypted data to untrusted workers/evaluators by issuing tokens. This ...
Secure obfuscation for encrypted signatures
EUROCRYPT'10: Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic TechniquesObfuscation is one of the most intriguing open problems in cryptography and only a few positive results are known. In TCC’07, Hohenberger et al. proposed an obfuscator for a re-encryption functionality, which takes a ciphertext for a message encrypted ...






Comments