1 An Efficient Strong Key-Insulated Signature Scheme and Its Application 5 th European PKI Workshop June 16-17, 2008 NTNU, Trondheim, Norway Go Ohtake.

Slides:



Advertisements
Similar presentations
E W H A W U New Nominative Proxy Signature Scheme for Mobile Communication April Seo, Seung-Hyun Dept. of Computer Science and.
Advertisements

Chapter 14 – Authentication Applications
Efficient Signature Generation by Smart Cards Suk Ki Kim Sunyeong Kim.
LOGO Multi-user Broadcast Authentication in Wireless Sensor Networks ICU Myunghan Yoo.
Network Security Term Project 2002 Fall Network Security Chul Joon Choi Prof. Kwang jo Kim Network Security Term Project (2002 Fall) 발표자 :
Implementation of LSI for Privacy Enhancing Computation Kazue Sako, Sumio Morioka
Leakage-Resilient Signatures Sebastian Faust KU Leuven Joint work with Eike Kiltz CWI Krzysztof Pietrzak CWI Guy Rothblum Princeton TCC 2010, Zurich, Switzerland.
Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.
Introduction to PKI Seminar What is PKI? Robert Brentrup July 13, 2004.
Ring Signatures of Sub- linear Size without Random Oracles Nishanth Chandran Jens Groth Amit Sahai University of California Los Angeles TexPoint fonts.
CMSC 414 Computer and Network Security Lecture 7 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 9 Jonathan Katz.
Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes Author: Stanislaw Jarecki and Xiaomin Liu University of California, Irvine From:
Security Arguments for Digital Signatures and Blind Signatures Journal of Cryptology, (2000) 13: Authors: D. Pointcheval and J. Stern Presented.
Security Arguments for Digital Signatures and Blind Signatures Journal of Cryptology, (2000) 13: Authors: D. Pointcheval and J. Stern Presented.
1 CIS 5371 Cryptography 9. Data Integrity Techniques.
CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.
Computer Science CSC 774 Adv. Net. SecurityDr. Peng Ning1 CSC 774 Advanced Network Security Topic 4. Broadcast Authentication.
Computer Science Public Key Management Lecture 5.
13.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 13 Digital Signature.
CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.
1 Self Protecting Cryptosystems Moti Yung Columbia University/ RSA Labs.
By Jyh-haw Yeh Boise State University ICIKM 2013.
8. Data Integrity Techniques
Information Security and Management 13. Digital Signatures and Authentication Protocols Chih-Hung Wang Fall
Lecture 8 Digital Signatures. This lecture considers techniques designed to provide the digital counterpart to a handwritten signature. A digital signature.
Bob can sign a message using a digital signature generation algorithm
1 Lect. 15 : Digital Signatures RSA, ElGamal, DSA, KCDSA, Schnorr.
Chapter 10: Authentication Guide to Computer Network Security.
CS555Topic 211 Cryptography CS 555 Topic 21: Digital Schemes (1)
Cryptography and Network Security Chapter 14 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Basel Alomair, Krishna Sampigethaya, and Radha Poovendran University of Washington TexPoint fonts used in EMF.
02/22/2005 Joint Seminer Satoshi Koga Information Technology & Security Lab. Kyushu Univ. A Distributed Online Certificate Status Protocol with Low Communication.
Cryptography Lecture 9 Stefan Dziembowski
Fall, Privacy&Security - Virginia Tech – Computer Science Click to edit Master title style Collusion-Resistant Group Key Management Using Attribute-
Foundations of Cryptography Lecture 6 Lecturer: Moni Naor.
Cryptography and Network Security (CS435) Part Eight (Key Management)
IND-CPA and IND-CCA Concepts Summary  Basic Encryption Security Definition: IND-CPA  Strong Encryption Security Definition: IND-CCA  IND-CPA, IND-CCA.
Cryptography Lecture 2 Arpita Patra. Summary of Last Class  Introduction  Secure Communication in Symmetric Key setting >> SKE is the required primitive.
Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.
1 Number Theory and Advanced Cryptography 6. Digital Signature Chih-Hung Wang Sept Part I: Introduction to Number Theory Part II: Advanced Cryptography.
1 一個新的代理簽章法 A New Proxy Signature Scheme 作 者 : 洪國寶, 許琪慧, 郭淑娟與邱文怡 報 告者 : 郭淑娟.
Signatures, etc. Network Security Gene Itkis Signature scheme: Formal definition GenKey Generation: Gen(1 k )   PK, SK  SignSigning: Sign(SK, M) 
Secure Communication between Set-top Box and Smart Card in DTV Broadcasting Authors: T. Jiang, Y. Hou and S. Zheng Source: IEEE Transactions on Consumer.
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures Tal Malkin (Columbia Univ.) Satoshi Obana (NEC and Columbia Univ.)
Shambhu Upadhyaya 1 Ad Hoc Networks – Network Access Control Shambhu Upadhyaya Wireless Network Security CSE 566 (Lecture 20)
1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,
Identity based signature schemes by using pairings Parshuram Budhathoki Department of Mathematical Science FAU 02/21/2013 Cyber Security Seminar, FAU.
Prepared by Dr. Lamiaa Elshenawy
A new provably secure certificateless short signature scheme Authors: K.Y. Choi, J.H. Park, D.H. Lee Source: Comput. Math. Appl. (IF:1.472) Vol. 61, 2011,
Certificate-based Binding Update Protocol (CBU) draft-qiu-mip6-certificated-binding-update-02.txt Feng Bao Robert Deng Ying Qiu Jianying Zhou Institute.
A New Provably Secure Certificateless Signature Scheme Date: Reporter:Chien-Wen Huang 出處 :2008 IEEE International Conference on Communications.
Private key
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
1/28 Chosen-Ciphertext Security from Identity- Based Encryption Jonathan Katz U. Maryland Ran Canetti, Shai Halevi IBM.
Jonathan Katz University of Maryland Andrew Lindell Aladdin Knowledge Systems and Bar-Ilan University 04/08/08 CRYP-108 Aggregate Message- Authentication.
1 An Ordered Multi-Proxy Multi-Signature Scheme Authors: Min-Shiang Hwang, Shiang-Feng Tzeng, Shu-Fen Chiou Speaker: Shu-Fen Chiou.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
COM 5336 Lecture 8 Digital Signatures
ICICS2002, Singapore 1 A Group Signature Scheme Committing the Group Toru Nakanishi, Masayuki Tao, and Yuji Sugiyama Dept. of Communication Network Engineering.
Threshold password authentication against guessing attacks in Ad hoc networks ► Chai, Zhenchuan; Cao, Zhenfu; Lu, Rongxing ► Ad Hoc Networks Volume: 5,
Fall 2006CS 395: Computer Security1 Key Management.
Forward Secure Signatures on Smart Cards A. Hülsing, J. Buchmann, C. Busold | TU Darmstadt | A. Hülsing | 1.
Certificateless signature revisited
Digital signatures.
Digital Signature Schemes and the Random Oracle Model
Foundations of Fully Dynamic Group Signatures
A New Provably Secure Certificateless Signature Scheme
Cryptography Lecture 10.
Cryptography Lecture 26.
Presentation transcript:

1 An Efficient Strong Key-Insulated Signature Scheme and Its Application 5 th European PKI Workshop June 16-17, 2008 NTNU, Trondheim, Norway Go Ohtake 1, Goichiro Hanaoka 2, and Kazuto Ogawa 1 1 Japan Broadcasting Corporation 2 National Institute of Advanced Industrial Science and Technology

2 Motivation

3 Background “Key exposure” is a critical problem !!  Even if a “secure” signature scheme is used, key leakage results in impersonation of the user. more critical for bidirectional broadcasting services !!

4 Bidirectional broadcasting service Signed Request Personal information Broadcaster network Smart card User Verification key Signing key e.g. TV shopping, Quiz program, etc. Service property: Real-time service

5 Problem for signing key leakage Signed Request Personal information Broadcaster network Smart card User Verification key Signing key key leakage Adversary Signed Request Personal information Key update Critical damage !! Broadcaster =

6 Problem for key update in bidirectional broadcasting service PKI cannot be applied directly. Smart card network User 1 User 2 User 3 User n Broadcaster Signing key Verification key CRL Verification key update CA Heavy load !! Real-time service cannot be offered !!

7 Solution Strong key-insulated signature (KIS) scheme Smart card network User 1 User 2 User 3 User n Broadcaster Verification key Signing key update Verification key does NOT have to be updated. No CRL!! No redistribution of verification key !!

8 Motivation In bidirectional broadcasting service, …  Signature size is required as short as possible Multiple copies of signed message are individually transmitted to users.  Conventional strong KIS scheme not efficient !! Our target Design an efficient strong KIS scheme with a significantly short signature size

9 Related works

10 Adversary Key-insulated signature (KIS) scheme Proposed by Dodis, Katz, Xu, Yung in 2003 [DKXY03] master key [DKXY03] Y. Dodis, J. Katz, S. Xu, and M. Yung : “Strong Key-Insulated Signature Schemes,'‘ Proc. of PKC’03. (2003) Signer Verifier message + signature with time stamp old signing key update signing key time stamp partial key verification key verify signature reject secure against signing key leakage secure device

11 Adversary Strong KIS scheme Proposed by Dodis, Katz, Xu, Yung in 2003 [DKXY03] master key [DKXY03] Y. Dodis, J. Katz, S. Xu, and M. Yung : “Strong Key-Insulated Signature Schemes,'‘ Proc. of PKC’03. (2003) message + signature with time stamp old signing key update signing key time stamp partial key verification key verify signature secure device reject secure against signing key leakage or master key leakage Signer Verifier

12 Our contribution

13 Performance CB schemeGQ schemeOur scheme Verification key size (bits) Signature size (bits) Computational cost (signing) Computational cost (verification) Security assumptionDLRSADL CB scheme: Certificate-based strong KIS scheme using the Schnorr signatures GQ scheme: strong KIS scheme based on the Guillou-Quisquater signature

14 Security Our strong KIS scheme is secure  We achieved the same level of security as conventional strong KIS schemes. Adversary master key leakage valid signing key leakage or Signer

15 Our construction

16 Basic concept of our KIS scheme Efficient strong KIS scheme  By extending Abe-Okamoto proxy signature scheme [AO02] Efficient proxy signature scheme in terms of verification cost and communication cost [AO02] M.Abe and T.Okamoto : “Delegation Chains Secure up to Constant Length,'‘ IEICE Trans. (2002) Constructing an efficient strong KIS scheme from the Abe-Okamoto scheme is not a trivial exercise.

17 Why is it not a trivial exercise? (1) Extend the KIS scheme to a strong KIS scheme without increasing the signature size.  Conversion of proxy signature scheme to KIS scheme Proposed by Malkin, Obana, Yung in [MOY04] The resulting KIS scheme is not a strong KIS scheme.  Conversion of (standard) KIS scheme to strong KIS scheme Proposed by Dodis, Katz, Xu, Yung in [DKXY03] Employs double signing: a signature with the master key and a signature with the signer’s secret key not efficient We must construct a scheme without the above conversions. [MOY04] T. Malkin, S. Obana, and M. Yung : “The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures,'‘ Proc. of Eurocrypt’04,. (2004)

18 Why is it not a trivial exercise? (2) Extend the Abe-Okamoto scheme to a KIS scheme that provides adaptive security  Not taken into consideration in the security definition of [AO02] We must address adaptive security with a formal security proof from scratch.

19 Our proposed KIS scheme (1) Secure device Signer master key: verification key: Gen: key generation algorithm essential secret info.

20 Our proposed KIS scheme (2) Upd * : partial key generation algorithm Upd: key-update algorithm ? Secure device Signer time stamp signing key for a time period T master keypartial key Verifying partial key Upd* Upd

21 Our proposed KIS scheme (3) Sign: signing algorithm Vrfy: verifying algorithm ? Signer Verifier signing key Verifying signature verification key Sign Vrfy time stamp

22 Remarkable properties of our scheme A signer can update their signing key without updating verification key. The signature size of our scheme is significantly short : 480 bits

23 Another feature of our scheme Partial key verification  The signer can verify whether the partial key transmitted from the secure device is valid. If the secure device storing the master key is completely reliable, …  Partial key verification is unnecessary during the signing key update.  One of the verification keys can be, instead of and. Verification key size can be reduced by half.

24 Security Analysis

25 Basic concept of Security definition (1) KIS scheme Adversary valid signing key Broadcaster

26 Basic concept of Security definition (2) Strong KIS scheme Adversary valid master key Broadcaster

27 Security definition of KIS scheme Adversary A Signing oracle Forged signature Random oracle Key exposure oracle Success probability of signature forgery Security definition of KIS scheme k : security parameter N : total number of time periods A is allowed to submit a query to the key exposure oracle up to t times. If is negligible, is (t,N)- key-insulated. If is (N-1,N)-key-insulated, is perfectly key-insulated.

28 Security definition of strong KIS scheme Adversary B Signing oracle Forged signature Random oracle Success probability of signature forgery Security definition of strong KIS scheme k : security parameter N : total number of time periods If is negligible, is strong (t,N)-key-insulated. If is strong (N-1,N)-key-insulated, is perfectly strong key-insulated. master key

29 Overview of security proof Step1: modified Schnorr signature scheme EUF-ACMA secure under DL assumption Step2: our scheme key-insulated if the modified Schnorr signature scheme is EUF-ACMA secure. Step3: our scheme strong key-insulated if our scheme is key- insulated. Our scheme is strong key-insulated under DL assumption

30 Application

31 Bidirectional content distribution system (proposed by Ohtake, Hanaoka, Ogawa in 2006) Network Broadcaster User Content server Personal information management server Key management server master key Smart card Terminal Generate master key verification key initial signing key Update signing key Generate partial key Verify signature Create signature Our KIS scheme can be applicable.

32 Improved system based on our scheme network Content server Personal information management server Key management server Smart card PK Terminal master key x 0 x’x’ Reduced damage due to master key leakage - Even if the master key x 0 is leaked, the signing key cannot be updated without x’. Efficient verification - Verification key size: 160 bits - Suitable for a smart card Efficient signing - Signature size: 480 bits - Reduce the network cost for transmitting signed messages Broadcaster User

33 Summary

34 Summary Efficient strong KIS scheme  Significantly short signature size: 480 bits  Provably secure under DL assumption The most suitable signature scheme for bidirectional broadcasting services

35 Thank you for your attention !!