多媒體網路安全實驗室 Anonymous ID Signature Scheme with Provable Identity Date:2010.04.02 Reporter :Chien-Wen Huang 出處: 2008 Second International Conference on Future.

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

An Introduction to Pairing Based Cryptography Dustin Moody October 31, 2008.
多媒體網路安全實驗室 An efficient and security dynamic identity based authentication protocol for multi-server architecture using smart cards 作者 :JongHyup LEE 出處.
BY JYH-HAW YEH COMPUTER SCIENCE DEPT. BOISE STATE UNIVERSITY Proxy Credential Forgery Attack to Two Proxy Signcryption Schemes.
多媒體網路安全實驗室 Improved Secure Anonymous Authentication Scheme for Roaming Service in Global Mobility Networks Date : Reporter : Hong Ji Wei Authors.
Lect. 18: Cryptographic Protocols. 2 1.Cryptographic Protocols 2.Special Signatures 3.Secret Sharing and Threshold Cryptography 4.Zero-knowledge Proofs.
多媒體網路安全實驗室 Source:International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH- MSP),2010 Sixth. Authors:Hsiang-Cheh.
Identity Based Encryption
Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.
1 Identity-Based Encryption form the Weil Pairing Author : Dan Boneh Matthew Franklin Presentered by Chia Jui Hsu Date :
1 A practical off-line digital money system with partially blind signatures based on the discrete logarithm problem From: IEICE TRANS. FUNDAMENTALS, VOL.E83-A,No.1.
Identity-based authenticated key agreement protocol based on Weil pairing N.P.Smart ELECTRONICS LETTERS 20 th June 2002 vol.38 No13 p Present by.
Efficient fault-tolerant scheme based on the RSA system Author: N.-Y. Lee and W.-L. Tsai IEE Proceedings Presented by 詹益誌 2004/03/02.
Certificateless Authenticated Two-Party Key Agreement Protocols
Inter-Domain Identity-Based Authenticated Key Agreement Protocols from Weil Pairing Authors: Hong-bin Tasi, Yun-Peng Chiu and Chin-Laung Lei From:ISC2006.
1 Hidden Exponent RSA and Efficient Key Distribution author: He Ge Cryptology ePrint Archive 2005/325 PDFPDF 報告人:陳昱升.
Identity Base Threshold Proxy Signature Jing Xu, Zhenfeng Zhang, and Dengguo Feng Form eprint Presented by 魏聲尊.
A Double-Efficient Integrity Verification Scheme to Cloud Storage Data Deng Hongyao, Song Xiuli, Tao jingsong 2014 TELKOMNIKA Indonesian Journal of Electrical.
Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.
Computer Science Public Key Management Lecture 5.
By Jyh-haw Yeh Boise State University ICIKM 2013.
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
多媒體網路安全實驗室 A Strong User Authentication Framework for Cloud Computing Date : Reporter : Hong Ji Wei Authors : Amlan Jyoti Choudhury, Mangal.
Information Security Principles Assistant Professor Dr. Sana’a Wafa Al-Sayegh 1 st Semester ITGD 2202 University of Palestine.
(Multimedia University) Ji-Jian Chin Swee-Huay Heng Bok-Min Goi
An Efficient Identity-based Cryptosystem for
多媒體網路安全實驗室 A Security Framework of Group Location-Based Mobile Applications in Cloud Computing Date : Reporter : Hong Ji Wei Authors : Yu-Jia.
多媒體網路安全實驗室 A novel user identification scheme with key distribution preserving user anonymity for distributed computer networks Date:2011/10/05 報告人:向峻霈.
1 Anonymous Roaming Authentication Protocol with ID-based Signatures Lih-Chyau Wuu Chi-Hsiang Hung Department of Electronic Engineering National Yunlin.
多媒體網路安全實驗室 An Efficient RFID Authentication Protocol for Low-cost Tags Date : Reporter : Hong Ji Wei Authors : Yanfei Liu From : 2008 IEEE/IFIP.
Cyrtographic Security Identity-based Encryption 1Dennis Kafura – CS5204 – Operating Systems.
多媒體網路安全實驗室 A novel user authentication and privacy preserving scheme with smartcards for wireless communications 作者 :Chun-Ta Li,Cgeng-Chi Lee 出處 :Mathematical.
Topic 22: Digital Schemes (2)
1 A Secure System Based on Fingerprint Authentication Scheme Author : Zhe Wu,Jie Tian,Liang Li, Cai-ping Jiang,Xin Yang Prestented by Chia Jui Hsu.
Computer Science CSC 774 Advanced Network Security Topic 2.6 ID Based Cryptography #2 Slides by An Liu.
多媒體網路安全實驗室 Protecting the Privacy of Users in e-Commerce Environment Date: Reporter:Chien-Wen Huang Author: Chun-Hua Chen and Gwoboa Horng 出處:
Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.
Linkability of Some Blind Signature Schemes Swee-Huay Heng 1, Wun-She Yap 1 Khoongming Khoo 2 1 Multimedia University, 2 DSO National Laboratories.
P2: Privacy-Preserving Communication and Precise Reward Architecture for V2G Networks in Smart Grid P2: Privacy-Preserving Communication and Precise Reward.
多媒體網路安全實驗室 Certificateless multi-proxy signature Date:2011/04/08 報告人:向峻霈 出處 : Zhengping Jin, Qiaoyan Wen: Computer Communications, pp ,2011.
多媒體網路安全實驗室 Ontological recommendation multi-agent for Tainan City travel Date : Speaker : Hong Ji Wei Authors : Chang-Shing, Lee,Young-Chung.
多媒體網路安全實驗室 Robust authentication and key agreement scheme preserving Date:2011/11/05 報告人:向峻霈 出處 : Ren-Chiun Wang Wen-Shenq Juang Chin-Laung Lei Computer.
Cryptanalysis of Some Proxy Signature Schemes without Certificates Wun-She Yap, Swee-Huay Heng Bok-Min Goi Multimedia University.
多媒體網路安全實驗室 Mobility Assisted Secret Key Generation Using Wireless Link Signatures Date: Reporter : Hong Ji Wei Auther : Junxing Zhang Kasera,
Identity based signature schemes by using pairings Parshuram Budhathoki Department of Mathematical Science FAU 02/21/2013 Cyber Security Seminar, FAU.
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,
Fall, Privacy&Security - Virginia Tech – Computer Science Click to edit Master title style Cryptographic Security Identity-Based Encryption.
多媒體網路安全實驗室 Practical Searching Over Encrypted Data By Private Information Retrieval Date: Reporter: Chien-Wen Huang 出處: GLOBECOM 2010, 2010 IEEE.
A New Provably Secure Certificateless Signature Scheme Date: Reporter:Chien-Wen Huang 出處 :2008 IEEE International Conference on Communications.
Key Management Network Systems Security Mort Anvari.
多媒體網路安全實驗室 Anonymous Authentication Systems Based on Private Information Retrieval Date: Reporter: Chien-Wen Huang 出處: Networked Digital Technologies,
1 An Ordered Multi-Proxy Multi-Signature Scheme Authors: Min-Shiang Hwang, Shiang-Feng Tzeng, Shu-Fen Chiou Speaker: Shu-Fen Chiou.
多媒體網路安全實驗室 Source: IEICE Trans. Fundamentals, Vol. E90-A, No. 4, April 2007, pp Authors:Hong Lin Jin, Masaaki Fujiyoshi, Hitoshi Kiya Speaker:Cheng.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
多媒體網路安全實驗室 An efficient and security dynamic identity based authentication protocol for multi-server architecture using smart cards 作者 : Xiong Li, Yongping.
Key Generation Protocol in IBC Author : Dhruti Sharma and Devesh Jinwala 論文報告 2015/12/24 董晏彰 1.
多媒體網路安全實驗室 Private Information Retrieval Scheme Combined with E- Payment in Querying Valuable Information Date: Reporter: Chien-Wen Huang 出處:
多媒體網路安全實驗室 An ID-based client authentication with key agreement protocol for mobile client–server environment on ECC with provable security Date:2012/02/16.
多媒體網路安全實驗室 A Secure Privacy-Preserving Roaming Protocol Based on Hierarchical Identity-Based Encryption for mobile Networks 作者 :Zhiguo Wan,Kui Ren,Bart.
29/Jul/2009 Young Hoon Park.  M.Bellare, D.Micciancio, B.Warinschi, Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and.
多媒體網路安全實驗室 A novel user identification scheme with key distribution preserving user anonymity for distributed computer networks Date:2011/10/12 報告人:向峻霈.
Reporter :Chien-Wen Huang
Proxy Blind Signature Scheme
Certificateless signature revisited
Identity-based deniable authentication protocol
Source: Ad Hoc Networks, Vol. 71, pp , 2018
A New Provably Secure Certificateless Signature Scheme
Presentation transcript:

多媒體網路安全實驗室 Anonymous ID Signature Scheme with Provable Identity Date: Reporter :Chien-Wen Huang 出處: 2008 Second International Conference on Future Generation Communication and Networking

多媒體網路安全實驗室 Outline Introduction 1 Bilinear Maps and Some Concepts 2 Anonymous ID Signature Scheme with Provable Identity 33 Analysis on the Scheme 44 Conclusion 35

多媒體網路安全實驗室 Introduction  ID-based Public Key Cryptography(ID-PKC)  was firstly proposed by Shamir in  users can communicate securely without -exchanging public key certificates, -keeping a public key directory,or using online service of a third party.  Blind signature scheme  was firstly proposed by Chaum in  protect the privacy of the user effectively.  Identity-based blind signature (IBBS)

多媒體網路安全實驗室 Introduction  Blind signature scheme involves a)blind message signature scheme  message m was blinded to m’.  verification: on the signature of m would be valid with no leak of m to signer. b)blind parameter signature scheme  sign(m) which is the signature of message m could be blinded to sign’(m).  The verification on (m, sign’(m)) would be valid.

多媒體網路安全實驗室 Bilinear Maps and Some Concepts  Concepts of Bilinear Maps  Let G 1 and G 2 be two cyclic groups of prime order q.  G 1 is additive group,G 2 is a multiplicative group. 1)Bilinear is bilinear if 2)Non-degenerate The map does not send all pairs in to the identity in 3)Computable An efficient algorithm to compute for any

多媒體網路安全實驗室 Bilinear Maps and Some Concepts  Some Difficult Problems 1.Discrete Logarithm Problem For any,find,which satisfy is difficult. 2.Decision Diffie-Hellman Problem(DDHP) For, decide whether is difficult. 3.Computational Diffie-Hellman Problem(GDHP) For, given to compute is difficult. 4.gap Diffie-Hellman Problem(GDH) easy to decided whether and hard to compute. (easy to resolve DDHP and hard to resolve CDHP -> is a GDH group)

多媒體網路安全實驗室 Anonymous ID Signature Scheme with Provable Identity based on ID-based blind parameter signature scheme and BLS short signature scheme. 1)System Parameters Setup G 1 is a GDH group,G 2 is a multiplicative cyclic group, is a prime, 2)System Initialize Choose,compute.choose and public system parameter is

多媒體網路安全實驗室 Anonymous ID Signature Scheme with Provable Identity 3)Generate Key Pair for Verifying Identity of User the real identity of user is ID,computes,and corresponding private key. 4)Generate Key Pair for signing Make use of as private key, Corresponding public key is 5)Generate Anonymous Identity of User a)User send (ID,U) to KGC. b)KGC chooses,computes,and.then send (U’, S’) to user. c)User computes,and is the blind parameter signature d)User computes his anonymous

多媒體網路安全實驗室 Anonymous ID Signature Scheme with Provable Identity 6)Verify Anonymous Identity of User When doubt appears, user submits the evidence information to KGC involves KGC computes,and following formula exist: If exists, then compute 7)Message Sign a)Maps m to G 1, b)Computes,so signature is 8)Signature Verification Receives signature and obtains user’s public key if the following formula exists:

多媒體網路安全實驗室 Analysis on the Scheme Theorem 1 Verification for anonymous identity satisfies correctness. Proof: Theorem 2 Signature Verification satisfies correctness. Proof:

多媒體網路安全實驗室 Analysis on the Scheme Theorem 3 This scheme satisfies blindness. Proof: 1.user’s anonymous ID’ comes from the blinded signature that generated by KGC. 2.When doubt appears, KGC can not get private key a from (ID,U’,S,ID’),even have. Theorem 4 This scheme satisfies anonymity of identity. Proof: Because,KGC can not get S, so he can’t compute the anonymous.

多媒體網路安全實驗室 Conclusion  Shortage: when doubt appears(the anonymous identity would be leaked to KGC),user can’t use it any longer. Applying another anonymous identity would increase user’s spending on some aspects.  Tomorrow work: resolve the invalidation problem on anonymous identity after identity verification.

多媒體網路安全實驗室