Delegatable pseudorandom functions and applications

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 669-683

  Kiayias, Aggelos ^a   Papadopoulos, Stavros ^b   Triandopoulos, Nikos ^c   Zacharias, Thomas ^a  

^a UNIVERSITY OF ATHENS   (Greece)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c RSA Laboratories   (United States)

Author keywords

authentication; broadcast encryption; delegation of computation; pseudorandom functions; rfids; searchable encryption

Indexed keywords

BANDWIDTH EFFICIENCY; BROADCAST ENCRYPTION; CRYPTOGRAPHIC PRIMITIVES; DESIGN CHALLENGES; PSEUDO-RANDOM FUNCTIONS; RFIDS; SEARCHABLE ENCRYPTIONS; SECURITY APPLICATION;

AUTHENTICATION; CRYPTOGRAPHY; RADIO FREQUENCY IDENTIFICATION (RFID); SECURITY OF DATA;

FUNCTION EVALUATION;

EID: 84889072826     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2508859.2516668     Document Type: Conference Paper

References (34)

1. M. J. Atallah and K. B. Frikken. Securely outsourcing linear algebra computations. In Proc. of the 5th Symposium on Information, Computer and Comm. Security (ASIACCS), pages 48-59. ACM, 2010.
2. G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Trans. Inf. Syst. Secur., 9(1):1-30, Feb. 2006.
3. A. Barth, D. Boneh, and B. Waters. Privacy in encrypted content distribution using private broadcast encryption. In Proc. of the 10th Int. Conf. on Financial Cryptography and Data Security, pages 52-64. Springer, 2006.
4. S. Benabbas, R. Gennaro, and Y. Vahlis. Verifiable delegation of computation over large datasets. In Proc. of the 31st Annual Conf. on Advances in Cryptology (CRYPTO), pages 111-131. Springer, 2011.
5. M. Blaze, G. Bleumer, and M. Strauss. Divertible protocols and atomic proxy cryptography. In Proc. of the 17th Int. Conf. on the Theory and Application of Cryptographic Techniques (EUROCRYPT), pages 127-144. Springer, 1998.
6. A. Boldyreva, A. Palacio, and B. Warinschi. Secure proxy signature schemes for delegation of signing rights. Journal of Cryptology, 25:57-115, 2012.
7. D. Boneh and B. Waters. Constrained pseudorandom functions and their applications. In Proc. of the 19th Int. Conf. on the Theory and Application of Cryptology and Information Security (ASIACRYPT), 2013.
8. To appear; full version in Cryptology ePrint Archive, 2013:352.
9. E. Boyle, S. Goldwasser, and I. Ivan. Functional signatures and pseudorandom functions. IACR Cryptology ePrint Archive, 2013:401, 2013.
10. R. Canetti, B. Riva, and G. N. Rothblum. Practical delegation of computation using multiple servers. In Proc. of the 18th Conf. on Computer and Comm. Security (CCS), pages 445-454. ACM, 2011.
11. K.-M. Chung, Y. T. Kalai, and S. P. Vadhan. Improved delegation of computation using fully homomorphic encryption. In Proc. of the 30th Annual Conf. on Advances in Cryptology (CRYPTO), pages 483-501. Springer, 2010.
12. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky. Searchable symmetric encryption: Improved definitions and efficient constructions. In Proc. of the 13th Conf. on Computer and Comm. Security (CCS), pages 79-88. ACM, 2006.
13. Y. Dodis and A. Yampolskiy. A verifiable random function with short proofs and keys. In Proc. of the 8th Int. Workshop on Public Key Cryptography (PKC), pages 416-431. Springer, 2005.
14. N. Fazio and I. M. Perera. Outsider-anonymous broadcast encryption with sublinear ciphertexts. In Proc. of the 15th Int. Conf. on Public Key Cryptography (PKC), pages 225-242. Springer, 2012.
15. A. Fiat and M. Naor. Broadcast encryption. In Proc. of the 13st Annual Conf. on Advances in Cryptology (CRYPTO), pages 480-491. Springer, 1993.
16. D. Fiore and R. Gennaro. Publicly verifiable delegation of large polynomials and matrix computations, with applications. In Proc. of the 19th Conf. on Computer and Comm. Security (CCS), pages 501-512. ACM, 2012.
17. M. J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword search and oblivious pseudorandom functions. In Proc. of the 2nd Theory of Cryptography Conference (TCC), pages 303-324. Springer, 2005.
18. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM, 33(4):792-807, 1986.
19. S. Goldwasser, Y. T. Kalai, and G. N. Rothblum. Delegating computation: interactive proofs for muggles. In Proc. of the 40th Annual Symposium on Theory of Computing (STOC), pages 113-122. ACM, 2008.
20. M. Green and G. Ateniese. Identity-based proxy re-encryption. In Proc. of the 5th Int. Conf. on Applied Cryptography and Network Security (ACNS), pages 288-306. Springer, 2007.
21. S. Hohenberger and A. Lysyanskaya. How to securely outsource cryptographic computations. In Proc. of the 2nd Theory of Cryptography Conference (TCC), pages 264-282. Springer, 2005.
22. G. Itkis. Handbook of Information Security, chapter Forward Security: Adaptive Cryptography - Time Evolution. John Wiley and Sons, 2006.
23. A.-A. Ivan and Y. Dodis. Proxy cryptography revisited. In Proc. of the 10th Network and Distributed System Security Symposium (NDSS). The Internet Society, 2003.
24. S. Jarecki and X. Liu. Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection. In Proc. of the 6th Theory of Cryptography Conference (TCC), pages 577-594. Springer-Verlag, 2009.
25. S. Kamara, C. Papamanthou, and T. Roeder. Dynamic searchable symmetric encryption. In Proc. of the 19th Conf. on Computer and Comm. Security (CCS), pages 965-976. ACM, 2012.
26. B. Libert, K. G. Paterson, and E. A. Quaglia. Anonymous broadcast encryption: Adaptive security and efficient constructions in the standard model. In Proc. of the 15th Int. Conf. on Public Key Cryptography (PKC), pages 206-224. Springer, 2012.
27. M. Luby and J. Staddon. Combinatorial bounds for broadcast encryption. In Proc. of the 17th Int. Conf. on the Theory and Application of Cryptographic Techniques (EUROCRYPT), pages 512-526. Springer, 1998.
28. A. Lysyanskaya. Unique signatures and verifiable random functions from the DH-DDH separation. In Proc. of the 22nd Annual Conf. on Advances in Cryptology (CRYPTO), pages 597-612. Springer, 2002.
29. M. Mambo, K. Usuda, and E. Okamoto. Proxy signatures for delegating signing operation. In Proc. of the 3rd Conf. on Computer and Comm. Security (CCS), pages 48-57. ACM, 1996.
30. S. Micali, M. O. Rabin, and S. P. Vadhan. Verifiable random functions. In Proc. of the 40th Annual Symposium on Foundations of Computer Science (FOCS), pages 120-130. IEEE, 1999.
31. D. Molnar, A. Soppera, and D. Wagner. A scalable, delegatable pseudonym protocol enabling ownership transfer of RFID tags. In Proc. of the 12th Int. Workshop on Selected Areas in Cryptography (SAC), pages 276-290. Springer, 2006.
32. D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for stateless receivers. In Proc. of the 21st Annual Conf. on Advances in Cryptology (CRYPTO), pages 41-62. Springer, 2001.
33. M. Naor and B. Pinkas. Efficient trace and revoke schemes. Int. J. Inf. Sec., 9(6):411-424, 2010.
34. B. Parno, M. Raykova, and V. Vaikuntanathan. How to delegate and verify in public: verifiable computation from attribute-based encryption. In Proc. of the 9th Theory of Cryptography Conference (TCC), pages 422-439. Springer, 2012.