[1]

M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, H. Shi, Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions, Cryptology ePrint Archive, 2005.

http://eprint.iacr.org/
[2]

M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case/average-case equivalence, in 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, USA, May 4–6, 1997 (ACM Press, New York, 1997), pp. 284–293

[3]

M. Bellare, A. Boldyreva, A. Desai, D. Pointcheval, Key-privacy in public-key encryption, in Advances in Cryptology—ASIA CRYPT 2001, ed. by C. Boyd, Gold Coast, Australia, December 9–13, 2001. Lecture Notes in Computer Science, vol. 2248 (Springer, Berlin, 2001), pp. 566–582

[4]

M. Bellare, S.K. Miner, A forward-secure digital signature scheme, in Advances in Cryptology—CRYPTO’99, ed. by M.J. Wiener, Santa Barbara, CA, USA, August 15–19, 1999. Lecture Notes in Computer Science, vol. 1666 (Springer, Berlin, 1994), pp. 431–448

[5]

M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in ACM CCS 93: 1st Conference on Computer and Communications Security, Fairfax, VA, November 3–5, 1993 (ACM Press, New York, 1993), pp. 62–73

CrossRef[6]

D. Boneh, X. Boyen, Secure identity based encryption without random oracles, in Advances in Cryptology—CRYPTO 2004, ed. by M. Franklin, Santa Barbara, CA, August 15–19, 2004. Lecture Notes in Computer Science, vol. 3152 (Springer, Berlin, 2004), pp. 443–459

[7]

D. Boneh, X. Boyen, E.-J. Goh, Hierarchical identity based encryption with constant size ciphertext, in Advances in Cryptology—EUROCRYPT 2005, ed. by R. Cramer, Aarhus, Denmark, May 22–26, 2005. Lecture Notes in Computer Science, vol. 3494 (Springer, Berlin, 2005), pp. 440–456

[8]

D. Boneh, G. Di Crescenzo, R. Ostrovsky, G. Persiano, Public key encryption with keyword search, in Advances in Cryptology—EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, Interlaken, Switzerland, May 2–6, 2004. Lecture Notes in Computer Science, vol. 3027 (Springer, Berlin, 2004), pp. 506–522

[9]

D. Boneh, M.K. Franklin, Identity based encryption from the Weil pairing, SIAM J. Comput. 32(3), 586–615 (2003)

MATHCrossRefMathSciNet[10]

D. Boneh, Brent R. Waters, Conjunctive, subset, and range queries on encrypted data, in TCC 2007: 4th Theory of Cryptography Conference, ed. by S.P. Vadhan, Amsterdam, The Netherlands, February 21–24, 2007. Lecture Notes in Computer Science, vol. 4392 (Springer, Berlin, 2007). Also available at http://eprint.iacr.org/, Report 2006/287

[11]

X. Boyen, B. Waters, Anonymous hierarchical identity-based encryption (without random oracles), in Advances in Cryptology—CRYPTO 2006, ed. by C. Dwork, Santa Barbara, CA, August 20–24, 2006. Lecture Notes in Computer Science, vol. 4117 (Springer, Berlin, 2006), pp. 290–307

CrossRef[12]

R. Canetti, S. Halevi, J. Katz, A forward-secure public-key encryption scheme, in Advances in Cryptology—EUROCRYPT 2003, ed. by E. Biham, Warsaw, Poland, May 4–8, 2003. Lecture Notes in Computer Science, vol. 2656 (Springer, Berlin, 2003), pp. 255–271

CrossRef[13]

C. Dwork, M. Naor, O. Reingold, Immunizing encryption schemes from decryption errors, in Advances in Cryptology—EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, Interlaken, Switzerland, May 2–6, 2004. Lecture Notes in Computer Science, vol. 3027 (Springer, Berlin, 2004), pp. 342–360

[14]

C. Gentry, Practical identity-based encryption without random oracles, in Advances in Cryptology—EUROCRYPT 2006, ed. by S. Vaudenay, St. Petersburg, Russia, May 28–June 1, 2006. Lecture Notes in Computer Science, vol. 4004 (Springer, Berlin, 2006), pp. 445–464

CrossRef[15]

C. Gentry, A. Silverberg, Hierarchical ID-based cryptography, in Advances in Cryptology—ASIACRYPT 2002, ed. by Y. Zheng, Queenstown, New Zealand, December 1–5, 2002. Lecture Notes in Computer Science, vol. 2501 (Springer, Berlin, 2002), pp. 548–566

CrossRef[16]

E.-J. Goh, Secure indexes, Cryptology ePrint Archive, Report 2003/216, 2003.

http://eprint.iacr.org/
[17]

O. Goldreich, Foundations of Cryptography: Basic Applications, vol. 2 (Cambridge University Press, Cambridge, 2004)

MATH[18]

P. Golle, J. Staddon, B.R. Waters, Secure conjunctive keyword search over encrypted data, in ACNS 04: 2nd International Conference on Applied Cryptography and Network Security, ed. by M. Jakobsson, M. Yung, J. Zhou, Yellow Mountain, China, June 8–11, 2004. Lecture Notes in Computer Science, vol. 3089 (Springer, Berlin, 2004), pp. 31–45

[19]

S. Halevi, A sufficient condition for key-privacy, Cryptology ePrint Archive, Report 2005/005, 2005.

http://eprint.iacr.org/
[20]

J. Horwitz, B. Lynn, Toward hierarchical identity-based encryption, in Advances in Cryptology—EUROCRYPT 2002, ed. by L.R. Knudsen, Amsterdam, The Netherlands, April 28–May 2, 2002. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 466–481

CrossRef[21]

T. Malkin, D. Micciancio, S.K. Miner, Efficient generic forward-secure signatures with an unbounded number of time periods, in Advances in Cryptology—EUROCRYPT 2002, ed. by L.R. Knudsen, Amsterdam, The Netherlands, April 28–May 2, 2002. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 400–417

CrossRef[22]

D.J. Park, K. Kim, P.J. Lee, Public key encryption with conjunctive field keyword search, in WISA 04: 5th International Workshop on Information Security Applications, ed. by C.H. Lim, M. Yung, Jeju Island, Korea, August 23–25, 2004. Lecture Notes in Computer Science, vol. 3325 (Springer, Berlin, 2004), pp. 73–86

[23]

A. Shamir, Identity-based cryptosystems and signature schemes, in Advances in Cryptology—CRYPTO’84, ed. by G.R. Blakley, D. Chaum, Santa Barbara, CA, August 19–23, 1985. Lecture Notes in Computer Science, vol. 196 (Springer, Berlin, 1985), pp. 47–53

CrossRef[24]

D.X. Song, D. Wagner, A. Perrig, Practical techniques for searches on encrypted data, in 2000 IEEE Symposium on Security and Privacy, Oakland, CA, May 2000 (IEEE Computer Society Press, Reading, 2000), pp. 44–55

[25]

B.R. Waters, Efficient identity-based encryption without random oracles, in Advances in Cryptology—EUROCRYPT 2005, ed. by R. Cramer, Aarhus, Denmark, May 22–26, 2005. Lecture Notes in Computer Science, vol. 3494 (Springer, Berlin, 2005), pp. 114–127

[26]

B.R. Waters, D. Balfanz, G. Durfee, D.K. Smetters, Building an encrypted and searchable audit log, in ISOC Network and Distributed System Security Symposium—NDSS 2004, San Diego, CA, February 4–6, 2004 (The Internet Society, Reston, 2004)