TRANSITIONING TO A QUANTUM-RESISTENT PUBLIC KEY INFRASTRUCTURE Nina Bindel PQCrypto 2017 Udyani Herath Utrecht, The Nederlands Matthew McKague 06/26/2017 Douglas Stebila
1 7 chance of breaking RSA-2048 (Michele Mosca ā Nov 2015) 1 2 chance of breaking RSA-2048 Start (Michele Mosca ā Nov 2015) Universal quantum computer PQ project (Quantum Manifesto) Jan. Today Nov. 2031 2035 2002 2016 2026 2017 2017 18 years MS started to stopp support of SHA-1 ? Best: start transition now 15 years 2
BIT-HARDNESS ESTIMATIONS WITH LWE-ESTIMATOR [APS15] 80 71 70 62 61 60 Difference of 58 60 ~20 bit in 2.5 years Log hardness 48 50 40 30 20 LWE Instance - Regev(128) 10 n=128, q=16411, š =29.6 0 Jan 2015 Jun 2015 Jan 2016 Jun 2016 Jan 2017 Jun 2017 3
CURRENT SITUATION Unstable hardness Quantum threat against estimations of āPQ RSA- and discrete log assumptions ā 4
HYBRID SIGNATURE SCHEMES Given: Ī£ 1 and Ī£ 2 Construct: Ī£ C s.t. Ī£ C is secure if Ī£ 1 or Ī£ 2 secure Example: ⢠Σ 1 PQ scheme and Ī£ 2 classical scheme ⢠2 PQ schemes based on different assumptions Q ⢠What means ā secure ā? ⢠How to construct Ī£ š· ? ⢠Can we use hybrids in current protocols and standards? 5
SECURITY DEFINITION Intuition : ⢠eUF-CMA with 2-stage adversary A = (šµ 1 , šµ 2 ) ⢠šµ 1 , šµ 2 different access to quantum computer ⢠šµ 1 classical/quantum access to sign oracle 6
EUFāCMA (A) : EXPT Ī£ q s ā 0 sk, vk Ī£. KeyGen() Ī S m 1 , Ļ 1 , ⦠, (m q s +1 , Ļ q s +1 ) A(vk) q s ā q s + 1 If Ī£. Verify vk, m i , Ļ i = 1 Return 1 Else Return 0 7
EUFāCMA (A) : EXPT Ī£ A 1 , A 2 : 010ā¦1 / ? q s ā 0 sk, vk Ī£. KeyGen() 010ā¦1 / ? Ī S st A 1 (vk) q s ā q s + 1 m 1 , Ļ 1 , ⦠, (m q s +1 , Ļ q s +1 ) A 2 (st) If Ī£. Verify vk, m i , Ļ i = 1 Return 1 010ā¦1 / ? Else Return 0 8
ADVERSARY MODEL ⢠šµ 1 classical š š š - Fully classical (eUF-CMA) ⢠Access to Ī S classical ⢠šµ 2 classical ⢠šµ 2 : š š š - Future quantum ⢠šµ 1 : ⢠šµ 1 : š š š - Quantum adversary ⢠šµ 2 : ⢠šµ 2 : š š« š - Fully quantum (also in [BZ13]) ⢠Access Ī S : THEOREM š š š š š š š š« š š š š 9
EXAMPLES OF HYBRID SIGNATURES Ī£ 1 X y Z -secure Ī£ 2 U v W -secure Combiner Unforgeability š = (š š , š š ) max{ X y Z, U v W } C || Ļ 1 ā Sign 1 m Ļ 2 ā Sign 2 m max{ X y Z, U v W } C nest Ļ 1 ā Sign 1 m Ļ 2 ā Sign 2 m, Ļ 1 X y Z wrt to m 1 , C dualānest Ļ 1 ā Sign 1 m 1 U v W Ļ 2 ā Sign 2 m 1 , Ļ 1 , m 2 10
APPLICABLE TO CURRENT PKI? ⢠Certificates: X.509v3 ⢠Secure channels: TLS ⢠Secure email: S/MIME (1) How can hybrid combiners be used in current standards? Q (2) What about backwards-compatibility? (3) Do large key and siganture size raise problems? 11
HYBRID SIGNATURE IN S/MIME EMAIL Idea: 2nd Idea: ⢠Use concatenation combiner ⢠Use nested combiner ⢠S/MIME data structures allow multiple ⢠Use optional attributes parallel signatures ⢠Disadvantage: Verification of all signatures ļ backwards-compatibility? 12
HYBRID SIGNATURES IN X.509V3 CERT Idea: Certificate c 2 (RSA) ⢠Use dual nested combiner tbsCertificate m 2 : ⢠PQ cert = extension of RSA cert Sub CA, subject, vk RSA CA , ( m 2 , vk RSA Sub , c 1 , m 1 )) ⢠Hybrid software recognizes and c 2 = Sign RSA (sk RSA Extensions: processes PQ cert and RSA cert Ext. id. = non-critical ⢠Older softeware ignores non-critical ext. Certificate c 1 (PQ) CA , sk RSA CA , vk RSA tbsCertificate m 1 : CA , vk PQ CA sk PQ ā KeyGen dualānest Sub CA, subject, vk PQ Sub , sk RSA Sub , vk PQ Sub , vk RSA Sub sk PQ ā KeyGen dualānest CA , ( m 1 , vk PQ Sub )) c 1 = Sign PQ (sk PQ 13
COMPATIBILITY OF HYBRID X.509V3 CERTS Application Extension size [KB] 1.5 3.5 9.0 43.0 1333.0 ļ¼ ļ¼ ļ¼ ļ¼ ļ» GnuTLS Libraries ļ¼ ļ¼ ļ¼ ļ¼ ļ¼ Java SE ļ¼ ļ¼ ļ¼ ļ» ļ» mbedTLS NSS ļ¼ ļ¼ ļ¼ ļ¼ ļ» ļ¼ ļ¼ ļ¼ ļ¼ ļ» OpenSSL ļ¼ ļ¼ ļ¼ ļ¼ ļ¼ Apple Safari Web browsers ļ¼ ļ¼ ļ¼ ļ¼ ļ» Google Chrome ļ¼ ļ¼ ļ¼ ļ» ļ» MS Edge MS IE ļ¼ ļ¼ ļ¼ ļ» ļ» ļ¼ ļ¼ ļ¼ ļ¼ ļ» Mozilla Firefox ļ¼ ļ¼ ļ¼ ļ¼ ļ» Opera 14
SUMMARY ⢠Security experiment with 2-stage adversary ⢠Adversary model with respect to quantum power ⢠Construction of hybrid signature schemes ⢠Compatibility of with current PKI: ⢠Nested single message in S/MIME ⢠Nested dual message in X.509 cert in applications ⢠Left out: non-separability THANKS 15
Recommend
More recommend