지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록· 키워드
오류제보하기
In this work we deal with the problem of how to squeeze multiple ciphertexts without losing original message information. To do so, we formalize the notion of decomposability for public-key encryption and investigate why adding decomposability is challenging. We construct an ElGamal encryption scheme over extension fields, and show that it supports the efficient decomposition. We then analyze security of our scheme under the standard DDH assumption, and evaluate the performance of our construction.
목차
등록된 정보가 없습니다.
참고문헌 (28)
참고문헌 신청
C. Gentry / 2004 / How to compress Rabin ciphertexts and signatures (and more), Advances in Cryptology-Crypto, Matthew K. Franklin / LNCS 3152 : 179 ~ 200
D. Boneh / 1998 / The decision Diffie-Hellman problem, ANTS, Joe Buhler / LNCS 1423 : 48 ~ 63
D. Boneh / 2000 / Why textbook ElGamal and RSA encryption are insecure, Advances in Cryptology-AsiaCrypt, Tatsuaki Okamoto / LNCS 1976 : 30 ~ 43
D. Cantor / 1981 / A new algorithm for factoring polynomials over finite fields / Math. Comp 36 (154) : 587 ~ 592
D. Goldschlag / 1999 / Onion routing / Commun. ACM 42 (2) : 39 ~ 41
D. Boneh / 1998 / The decision Diffie-Hellman problem, ANTS, Joe Buhler / LNCS 1423 : 48 ~ 63
D. Boneh / 2000 / Why textbook ElGamal and RSA encryption are insecure, Advances in Cryptology-AsiaCrypt, Tatsuaki Okamoto / LNCS 1976 : 30 ~ 43
D. Cantor / 1981 / A new algorithm for factoring polynomials over finite fields / Math. Comp 36 (154) : 587 ~ 592
D. Goldschlag / 1999 / Onion routing / Commun. ACM 42 (2) : 39 ~ 41
이 논문의 저자 정보
최근 본 자료
댓글(0)
0