메뉴 건너뛰기




Volumn 24, Issue 4, 2011, Pages 694-719

Securely obfuscating re-encryption

Author keywords

Obfuscation; Re encryption

Indexed keywords

CIPHERTEXTS; IMPOSSIBILITY RESULTS; OBFUSCATION; POINT FUNCTIONS; PUBLIC KEYS; RE-ENCRYPTION; SECURITY-AWARE; THE STANDARD MODEL;

EID: 80053053819     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-010-9077-7     Document Type: Article
Times cited : (37)

References (20)
  • 1
    • 33745218758 scopus 로고    scopus 로고
    • Improved proxy re-encryption schemes with applications to secure distributed storage
    • 10.1145/1127345.1127346
    • G. Ateniese K. Fu M. Green S. Hohenberger 2006 Improved proxy re-encryption schemes with applications to secure distributed storage ACM Trans. Inf. Syst. Secur. 9 1 1 30 10.1145/1127345.1127346
    • (2006) ACM Trans. Inf. Syst. Secur. , vol.9 , Issue.1 , pp. 1-30
    • Ateniese, G.1    Fu, K.2    Green, M.3    Hohenberger, S.4
  • 4
    • 84957718934 scopus 로고    scopus 로고
    • Divertible protocols and atomic proxy cryptography
    • Advances in Cryptology - EUROCRYPT '98
    • M. Blaze, G. Bleumer, M. Strauss, Divertible protocols and atomic proxy cryptography, in Advances in Cryptology-EUROCRYPT'98, ed. by K. Nyberg. Lecture Notes in Computer Science, vol. 1403 (Springer, Berlin, 1998), pp. 127-144 (Pubitemid 128081481)
    • (1998) Lecture Notes in Computer Science , Issue.1403 , pp. 127-144
    • Blaze, M.1    Bleumer, G.2    Strauss, M.3
  • 7
    • 84958626314 scopus 로고    scopus 로고
    • Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information
    • Advances in Cryptology - CRYPTO '97
    • R. Canetti, Towards realizing random oracles: Hash functions that hide all partial information, in Advances in Cryptology-CRYPTO'97, ed. by B.S. Kaliski Jr. Lecture Notes in Computer Science, vol. 1294 (Springer, Berlin, 1997), pp. 455-469 (Pubitemid 127112572)
    • (1997) Lecture Notes in Computer Science , Issue.1294 , pp. 455-469
    • Canetti, R.1
  • 10
    • 34848837353 scopus 로고    scopus 로고
    • Correcting errors without leaking partial information
    • DOI 10.1145/1060590.1060688, STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing
    • Y. Dodis, A. Smith, Correcting errors without leaking partial information, in 37th ACM Symposium on Theory of Computing (STOC), ed. by H.N. Gabow, R. Fagin. (ACM, New York, 2005), pp. 654-663 (Pubitemid 43098639)
    • (2005) Proceedings of the Annual ACM Symposium on Theory of Computing , pp. 654-663
    • Dodis, Y.1    Smith, A.2
  • 12
    • 33748600953 scopus 로고    scopus 로고
    • On the impossibility of obfuscation with auxiliary input
    • DOI 10.1109/SFCS.2005.60, 1530747, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
    • S. Goldwasser, Y.T. Kalai, On the impossibility of obfuscation with auxiliary input, in 46th IEEE Symposium on Foundations of Computer Science (FOCS), ed. by É. Tardos. (IEEE Comput. Soc., Los Alamitos, 2005), pp. 553-562 (Pubitemid 44375765)
    • (2005) Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS , vol.2005 , pp. 553-562
    • Goldwasser, S.1    Kalai, Y.T.2
  • 17
    • 80053050424 scopus 로고    scopus 로고
    • Personal Communication
    • R. Pass, Personal Communication (2006)
    • (2006)
    • Pass, R.1
  • 19
    • 0021518106 scopus 로고
    • Theory of the learnable
    • DOI 10.1145/1968.1972
    • L.G. Valiant 1984 A theory of the learnable Commun. ACM 27 11 1134 1142 0587.68077 10.1145/1968.1972 (Pubitemid 15425292)
    • (1984) Communications of the ACM , vol.27 , Issue.11 , pp. 1134-1142
    • Valiant, L.G.1
  • 20
    • 33745541383 scopus 로고    scopus 로고
    • On obfuscating point functions
    • DOI 10.1145/1060590.1060669, STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing
    • H. Wee, On obfuscating point functions, in 37th ACM Symposium on Theory of Computing (STOC), ed. by H.N. Gabow, R. Fagin. (ACM, New York, 2005), pp. 523-532 (Pubitemid 43098625)
    • (2005) Proceedings of the Annual ACM Symposium on Theory of Computing , pp. 523-532
    • Wee, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.