フジオカ アツシ

藤岡 淳

Departmental Bulletin Paper総説departmental bulletin pape

藤岡, 淳

KANAGAWA University Repository

     Sequential Multiple Encryption: Security and Application  Atsushi FUJIOKA      1970                                                                      *  Professor, Department of Information Systems Creation   (ME: Multiple Encryption) [1, 2]1: (sequential type) (parallel type)    ( i)( 1)(2)                                                                     1 (hybrid type)  [1]  [3]   [4][5]   (PKE: public-key encryption)pk sk pk ( ID )( ) mpk sk c         : (pk, sk)  (1k)k 1 k (1k )  : c  (pk, m) pkm  : m = (sk, c) skc  m  k  b  A(a) A a b b = A(a) Ar b = A(a; r)  IDID IDID  ID (IBE: Identity-Based Encryption) params msk paramssk m( params)sk  ( params)c  ID  : (params; msk)  (1k) 1k (k ). : sk   (params, msk, )  params msk  ID  : c  (params, , m)  params ID m  : m = (params; sk ; c)params sk c  m  ( ) x0, x1 c* ( ) (CPA: Chosen Plaintext Attack)( )(CCA: Chosen Ciphertext Attack) ()(ACCA: Adaptively ChosenCiphertext Attack)      (3)  ID  ID  [6] k  = ()x {0, 1}* y {0, 1}* (1k)pk Pr[r {0, 1}rlen(k) : y = (pk; x; r)] g(x, y) ( rlen(k) k )x {0, 1}*, y {0, 1}*, (pk; sk)  (1k)  g(x,  y)        -[10]  g(x y) (pk sk)  (1k) k -pkpk    1  n skn ( )  n skn  n  k -     : (PKn, SKn)  n(1k) 1k (k ). : c  n(PKn, m) PKnm  : m = n(SKn, c) SKnc  m    ( 4) [1]   [2]    ( )( )( ) [2]    (= )         (TRPKE: Timed-Release Public-Key Encription)tpk tsk  tpk upk usk upk ID ( ) mupk, tpk TT sTsk sT  tpk cT       : (tpk, tsk )  (1k) 1k (k ). : (upk; usk)  (tpk)tpk. : sT  (tpk, tsk , T)tpk tsk T  : c  (tpk, T, upk, m)tpk T upkm  : m = (tpk, sT , usk, c)tpk sT usk c  m    [7]c T usk[8]usk upk ( 5)upk    [7, 8]c T sT2  [9]sTupk ( 6)                                                                      2 Cathalo  [8] sT Cheon  [7] sT sT        1      (usk T c) (upk T c)   (T sT c) (upk T c)   [4]  () ()( 7)     ( i)(c*  c* c* ) (c* )   3  i = ( i, i, i) (1  i n, n  2) Hhi (1  i  n) {0, 1}* {0, 1}rleni(k) rleni(k), ileni(k) k ileni(k) rleni(k) i hi {0, 1}ileni(k)    = ( n,  n, n)  n: 1k (k ). Step 1: i 1k (pki, ski) (i = 1, . . . , n)  Step 2: hi {0, 1}ileni(k)(i = 1, . . . , n)  Step 3: PKi = (pki, hi), SKi = (ski, hi)  (i = 1, . . . , n)  Step 4: PKn = (PK1, . . . , PKn)  Step 5: SKn = (SK1, . . . , SKn)  Step 6: (PKn, SKn)   PKn SKn                                                                     3 [4] -[10][4]  n-1 1 in: PKn m  r {0, 1}rlenn(k) rlenn(k) =rlen1(k)  Step 1: PKn (PK1, . . . , PKn)  Step 2: PKi (pki, hi) (i = 1, . . . , n)  Step 3: c0 = m r  Step 4: i = 1 n : ci = i(pki, ci-1; Hhi (ci-1))  Step 5: c = cn c  c m  n: SKn c  Step 1: SKn (SK1, . . . , SKn)  Step 2: SKi (ski, hi) (i = 1, . . . , n)  Step 3: c  = c  Step 4: i = n 1 : c = i(ski, c  )  c  = i(pki, c ; Hhi (c ))    Step 5: c  m r m  m   c = i(pki, c ; Hhi (c )) c      1, . . . , n (n  2)           1      i (2 i n)    i     i k -   1, . . . , n (n 2)     1 i (2 i n)  [9]ID ID() IDk --pk--pk- -g(x, y) pkn iii-1i-1 i-1i i-1i-1i-1i-10 --pk-   = ( , , )   = ( , , , ) ID  Hh1 {0, 1}* {0, 1} ibe.rlen(k) Hh2 {0, 1}* {0, 1}pke.rlen(k) ilen1(k), ilen2(k), ibe.rlen(k), pke.rlen(k) k ileni(k)ibe.rleni(k), pke.rleni(k) , hi {0, 1}ileni(k) IDpk params k    = ()  : 1k (k )  Step 1: 1k (params, msk)  Step 2: h1 {0, 1}ilen1(k)h2 {0, 1}ilen2(k)  Step 3: tpk = (params, h1, h2), tsk = msk  Step 4: (tpk, tsk )   tpktsk   tpk  Step 1: tpk (params, h1 h2) params k  Step 2:  1k (pk, sk)  Step 3: upk = pk, usk = (pk; sk)  Step 4: (upk, usk)   upk usk  : (tpk, tsk )T  Step 1: tpk (params, h1 h2)  Step 2: dT = (params, tsk,  T)  Step 3: sT = dT sT  T sT  : tpk Tupk (= pk) mr {0, 1}tre. rlen(k)  Step 1: tpk (params, h1 h2)  Step 2: : = (params, T, m  r; Hh1 (pk  T  m  r)) Step 3:  = (pk, ; Hh2 (pk  T  ))  Step 4: c =  c  c m  : tpk sTusk c  Step 1: tpk (params,  h1, h2)  Step 2: usk (pk, sk)  Step 3: = c  Step 4: = (sk,  )  Step 5:  = (pk, ; Hh2 (pk  T  ))   Step 6: m = (params; sT )  Step 7: = (params; T m ;Hh1 (pk  T  m ))  Step 8: m m  r  Step 9: m  m  IBE-PKE   IBE-PKE   ID  k -pk-    ID  k -pk-  1, 2    IBE-PKEPKE-IBE[11]      (1) R. Zhang, G. Hanaoka, J. Shikata, and H. Imai, On the Security of Multiple Encryption or CCA-security + CCA-security = CCA-security? , PKC 2004 (LNCS 2947), Springer, (2004), pp.360-374. (2) Y. Dodis and J. Katz, Chosen-Ciphertext Security of Multiple  Encryption , TCC 2005 (LNCS 3378), Springer, (2005), pp.188-209. (3) A.C-F. Chan and I.F. Blake, Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing , ICDCS 2005, IEEE, (2005), pp.504-513. (4) A. Fujioka, Y. Okamoto, and T. Saito, Security of Sequential Multiple Encryption , IEICE Transactions on Fundamentals, E95-A (1), (2012-01), pp.57-69. (5) A. Fujioka, Y. Okamoto, and T. Saito, Generic Construction of Strongly Secure Timed-Release Public-Key Encryption , IEICE Transactions on Fundamentals, E96-A (1), (2013-01), pp.76-91. (6) M. Bellare and P. Rogaway, Random Oracles are Practical: A Paradigm for Designing Efficient Protocols ,  ACMCCS '93, ACM, (1993) , pp. 62-73. (7) J.H. Cheon, N. Hopper, Y. Kim, and I. Osipkov, Timed-Release and Key-Insulated Public Key Encryption , FC 2006 (LNCS 4107), Springer, (2006), pp.191-205. (8) J. Cathalo, B. Libert, and J. J. Quisquater, Effcient and Non-Interactive Timed-Release Encryption , ICICS 2005 (LNCS 3783), Springer, (2005), pp.291-303. (9) S.S.M. Chow and S.-M. Yiu, Timed-Release Encryption Revisited , ProvSec 2008 (LNCS 5324), Springer, (2008), pp.38-51. (10) E. Fujisaki and T. Okamoto, How to Enhance the Security of Public-Key Encryption at Minimum Cost ,  PKC '99 (LNCS 1560), Springer, (1999), pp. 53-68. (11) R. Kikuchi, A. Fujioka, Y. Okamoto, and T. Saito, Strong Security Notions for Timed-Release Public-Key Encryption Revisited , ICISC 2011 (LNCS 7259), Springer, (2012), pp.88-108.   

Sequential Multiple Encryption: Security and Application

https://kanagawa-u.repo.nii.ac.jp/?action=repository_action_common_download&item_id=7695&item_no=1&attribute_id=18&file_no=2

Sequential Multiple Encryption: Security and Application

Abstract

Similar works

Full text

Available Versions

KANAGAWA University Repository