메뉴 건너뛰기




Volumn 55, Issue 11, 2012, Pages 56-64

Functional encryption: A new vision for public-key cryptography

Author keywords

[No Author keywords available]

Indexed keywords

INSECURE NETWORKS; LARGER NETWORKS; SECRET KEY; STORAGE SERVERS;

EID: 84869405506     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/2366316.2366333     Document Type: Article
Times cited : (85)

References (33)
  • 4
    • 35048841300 scopus 로고    scopus 로고
    • Efficient selective-id secure identity-based encryption without random oracles
    • Springer
    • Boneh, D. and Boyen, X. Efficient selective-id secure identity-based encryption without random oracles. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science, Springer, 2004, 223-238.
    • (2004) Proceedings of EUROCRYPT, Lecture Notes in Computer Science , pp. 223-238
    • Boneh, D.1    Boyen, X.2
  • 13
    • 77649240581 scopus 로고    scopus 로고
    • Computing arbitrary functions of encrypted data
    • Mar.
    • Gentry, C. Computing arbitrary functions of encrypted data. Commun. ACM 53, 3(Mar. 2010), 97-105.
    • (2010) Commun. ACM , vol.53 , Issue.3 , pp. 97-105
    • Gentry, C.1
  • 14
    • 70350642087 scopus 로고    scopus 로고
    • Fully homomorphic encryption using ideal lattices
    • ACM Press, New York
    • Gentry, C. Fully homomorphic encryption using ideal lattices. In Proceedings of STOC 2009, ACM Press, New York, 2009, 169-178.
    • (2009) Proceedings of STOC 2009 , pp. 169-178
    • Gentry, C.1
  • 16
    • 51849137205 scopus 로고    scopus 로고
    • Trapdoors for hard lattices and new cryptographic constructions
    • ACM Press, New York
    • Gentry, C., Peikert, C., and Vaikuntanathan, V. Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of STOC, ACM Press, New York, 2008, 197-206.
    • (2008) Proceedings of STOC , pp. 197-206
    • Gentry, C.1    Peikert, C.2    Vaikuntanathan, V.3
  • 18
    • 0023545076 scopus 로고
    • How to play any mental game or a completeness theorem for protocols with honest majority
    • ACM Press, New York
    • Goldreich, O., Micali, S., and Wigderson, A. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of STOC, ACM Press, New York, 1987, 218-229.
    • (1987) Proceedings of STOC , pp. 218-229
    • Goldreich, O.1    Micali, S.2    Wigderson, A.3
  • 21
  • 25
    • 77957011503 scopus 로고    scopus 로고
    • Fully secure functional encryption with general relations from the decisional linear assumption
    • Springer
    • Okamoto, T. and Takashima, K. Fully secure functional encryption with general relations from the decisional linear assumption. In Proceedings of CRYPTO, Lecture Notes in Computer Science, Springer, 2010, 191-208.
    • (2010) Proceedings of CRYPTO, Lecture Notes in Computer Science , pp. 191-208
    • Okamoto, T.1    Takashima, K.2
  • 31
    • 70350345210 scopus 로고    scopus 로고
    • Dual-system encryption: Realizing fully secure ibe and hibe under simple assumptions
    • Springer
    • Waters, B. Dual-system encryption: Realizing fully secure ibe and hibe under simple assumptions. In Proceedings of CRYPTO, Lecture Notes in Computer Science, Springer, 2009, 619-636.
    • (2009) Proceedings of CRYPTO, Lecture Notes in Computer Science , pp. 619-636
    • Waters, B.1
  • 33
    • 0020312165 scopus 로고
    • Protocols for secure computations (extended abstract)
    • IEEE Computer Society
    • Yao, A. C.-C. Protocols for secure computations (extended abstract). In Proceedings of FOCS, IEEE Computer Society, 1982, 160-164.
    • (1982) Proceedings of FOCS , pp. 160-164
    • Yao, A.C.-C.1


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