Efficient public key encryption with keyword search schemes from pairings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4990 LNCS, Issue , 2008, Pages 372-383

  Gu, Chunxiang ^a   Zhu, Yuefei ^a   Pan, Heng ^b  

^a ZHENGZHOU INFORMATION SCIENCE AND TECHNOLOGY INSTITUTE   (China)

^b ZHONGYUAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Keyword search; Pairings; Provable secure; Public key encryption

Indexed keywords

INDUSTRIAL ECONOMICS; ONLINE SEARCHING; SECURITY OF DATA;

BILINEAR PAIRINGS; COMPUTATIONAL ASSUMPTIONS; CONSISTENT; EFFICIENT; ENCRYPTION PROCEDURES; KEYWORD SEARCH; KEYWORD SEARCHES; PAIRING OPERATIONS; PAIRINGS; PROVABLE SECURE; PUBLIC KEY ENCRYPTION; PUBLIC KEYS; RANDOM ORACLE MODELS; SECURE CHANNELS;

CRYPTOGRAPHY;

EID: 54249087643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79499-8_29     Document Type: Conference Paper

References (13)

1. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506-522. Springer, Heidelberg (2004)
2. Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 205-222. Springer, Heidelberg (2005)
3. Waters, B., Balfanz, D., Durfee, G., Smetters, D.: Building an Encrypted and Searchable Audit Log. In: Network and Distributed System Security Symposium NDSS (2004)
4. Baek, J., Safiavi-Naini, R., Susilo, W.: Public Key Encryption with Keyword Search Revisited. Available on Cryptology ePrint Archive, Report 2005/119.
5. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilin, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, Springer, Heidelberg (2001)
6. Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223-238. Springer, Heidelberg (2004)
7. Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and Its Applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277-290. Springer, Heidelberg (2004)
8. Sakai, R., Kasahara, M.: ID based Cryptosystems with Pairing on Elliptic Curve. Cryptology ePrint Archive: Report 2003/054
9. Barreto, P., Kim, H., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, Springer, Heidelberg (2002)
10. p + x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
11. Sakai, Y., Sakurai, K.: Efficient Scalar Multiplications on Elliptic Curves without Repeated Doublings and Their Practical Performance. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 59-73. Springer, Heidelberg (2000)
12. Sakai, R., Kasahara, M.: ID based cryptosystems with pairing on elliptic curve. Cryptology ePrint Archive, Report 2003/054
13. Dolev, D., Dwork, C., Naor, M.: Non-Malleable Cryptography. SIAM Journal on Computing, 2000. Early version in proceedings of STOC 1991 (2000)