Verifiable random functions from identity-based key encapsulation

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

Volumn 5479 LNCS, Issue , 2009, Pages 554-571

  Abdalla, Michel ^a   Fiore, Dario ^b   Catalano, Dario ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF CATANIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CIPHERTEXT; DE-CAPSULATION; IDENTITY-BASED; KEY ENCAPSULATION MECHANISMS; PSEUDO RANDOM; SECRET KEY; VERIFIABLE RANDOM FUNCTION;

CRYPTOGRAPHY;

EID: 67650685950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01001-9_32     Document Type: Conference Paper

References (27)

1. Bentahar, K., Farshim, P., Malone-Lee, J., Smart, N.P.: Generic constructions of identity-based and certificateless KEMs. Journal of Cryptology 21(2), 178-199 (2008) (Pubitemid 351653335)
2. 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)
3. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.3027, pp. 56-73. Springer, Heidelberg (2004)
4. Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.3494, pp. 440-456. Springer, Heidelberg (2005) (Pubitemid 41313968)
5. Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.2139, pp. 213-229. Springer, Heidelberg (2001) (Pubitemid 33317917)
6. Boneh, D., Gentry, C., Hamburg, M.: Space-efficient identity based encryptionwithout pairings. In: 48th FOCS, Providence, USA, pp. 647-657. IEEE Computer Society Press, Los Alamitos (2007)
7. Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.2656, pp. 255-271. Springer, Heidelberg (2003)
8. Chase, M., Lysyanskaya, A.: Simulatable vRFs with applications to multi-theorem NIZK. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.4622, pp. 303-322. Springer, Heidelberg (2007)
9. Cheon, J.H.: Security analysis of the strong diffie-hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.4004, pp. 1-11. Springer, Heidelberg (2006) (Pubitemid 44072229)
10. Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol.2260, pp. 360-363. Springer, Heidelberg (2001)
11. Dodis, Y.: Efficient construction of (Distributed) verifiable random functions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.2567, pp. 1-17. Springer, Heidelberg (2002) (Pubitemid 36137124)
12. Dodis, Y., Puniya, P.: Verifiable random permutations. Cryptology ePrint Archive, Report 2006/078 (2006), http://eprint.iacr.org/
13. Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.3386, pp. 416-431. Springer, Heidelberg (2005) (Pubitemid 41231346)
14. Gentry, C.: Practical identity-based encryption without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.4004, pp. 445-464. Springer, Heidelberg (2006) (Pubitemid 44072255)
15. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM STOC, Seattle, Washington, USA, May 15-17, pp. 25-32. ACM Press, New York (1989)
16. Goldwasser, S., Ostrovsky, R.: Invariant signatures and non-interactive zeroknowledge proofs are equivalent. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.740, pp. 228-245. Springer, Heidelberg (1993)
17. Jarecki, S., Shmatikov, V.: Handcuffing big brother: an abuse-resilient transaction escrow scheme. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.3027, pp. 590-608. Springer, Heidelberg (2004) (Pubitemid 38717028)
18. Liskov, M.: Updatable zero-knowledge databases. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.3788, pp. 174-198. Springer, Heidelberg (2005) (Pubitemid 43763475)
19. Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing 17(2) (1988)
20. Lysyanskaya, A.: Unique signatures and verifiable random functions from the DHDDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.2442, pp. 597-612. Springer, Heidelberg (2002)
21. Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th FOCS, October 17-19, pp. 120-130. IEEE Computer Society Press, New York (1999) (Pubitemid 30539987)
22. Micali, S., Reyzin, L.: Soundness in the public-key model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.2139, pp. 542-565. Springer, Heidelberg (2001) (Pubitemid 33317936)
23. Micali, S., Rivest, R.L.: Micropayments revisited. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.2271, pp. 149-163. Springer, Heidelberg (2002)
24. Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th FOCS, Miami Beach, Florida, October 19-22, pp. 458-467. IEEE Computer Society Press, Los Alamitos (1997)
25. Sakai, R., Kasahara, M.: Id based cryptosystems with pairing on elliptic curve. In: 2003 Symposium on Cryptography and Information Security - SCIS 2003, Hamamatsu, Japan (2003), http://eprint.iacr.org/2003/054
26. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.196, pp. 47-53. Springer, Heidelberg (1985)
27. Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.3494, pp. 114-127. Springer, Heidelberg (2005) (Pubitemid 41313949)