A Simple Traceable Pseudonym Certificate System for RSA-based PKI SCGroup Jinhae Kim.

Slides:



Advertisements
Similar presentations
Smart Certificates: Extending X.509 for Secure Attribute Service on the Web October 1999 Joon S. Park, Ph.D. Center for Computer High Assurance Systems.
Advertisements

Chapter 14 – Authentication Applications
Authentication Applications. will consider authentication functions will consider authentication functions developed to support application-level authentication.
PIS: Unit III Digital Signature & Authentication Sanjay Rawat PIS Unit 3 Digital Sign Auth Sanjay Rawat1 Based on the slides of Lawrie.
Public Key Infrastructure A Quick Look Inside PKI Technology Investigation Center 3/27/2002.
Cryptography and Network Security Chapter 14
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
A Pairing-Based Blind Signature
SSL : An Overview Bruhadeshwar Bezawada International Institute of Information Technology, Hyderabad.
COMP043-Cryptology Week 4 – Certs and Sigs. Digital Signatures Digital signatures provide –Integrity –Authenticity and –Non-repudiation How do they work?
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.
Geneva, Switzerland, 2 June 2014 Introduction to public-key infrastructure (PKI) Erik Andersen, Q.11 Rapporteur, ITU-T Study Group 17 ITU Workshop.
 A public-key infrastructure ( PKI ) is a set of hardware, software, people, policies, and procedures needed to create, manage, distribute, use, store,
Lect. 18: Cryptographic Protocols. 2 1.Cryptographic Protocols 2.Special Signatures 3.Secret Sharing and Threshold Cryptography 4.Zero-knowledge Proofs.
Computer Security: Principles and Practice EECS710: Information Security Professor Hossein Saiedian Fall 2014 Chapter 23: Internet Authentication Applications.
Chapter 14 From Cryptography and Network Security Fourth Edition written by William Stallings, and Lecture slides by Lawrie Brown, the Australian Defence.
Lecture 23 Internet Authentication Applications
IAW 2006 Cascaded Authorization with Anonymous- Signer Aggregate Signatures Danfeng Yao Department of Computer Science Brown University Joint work with.
Chapter 5 Network Security Protocols in Practice Part I
Authentication Cristian Solano. Cryptography is the science of using mathematics to encrypt and decrypt data. Public Key Cryptography –Problems with key.
DESIGNING A PUBLIC KEY INFRASTRUCTURE
WAP Public Key Infrastructure CSCI – Independent Study Fall 2002 Jaleel Syed Presentation No 5.
16.1 © 2004 Pearson Education, Inc. Exam Planning, Implementing, and Maintaining a Microsoft® Windows® Server 2003 Active Directory Infrastructure.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 6 Wenbing Zhao Department of Electrical and Computer Engineering.
CMSC 414 Computer and Network Security Lecture 7 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 9 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes Author: Stanislaw Jarecki and Xiaomin Liu University of California, Irvine From:
Public Key Distribution and X.509 Wade Trappe. Distribution of Public Keys There are several techniques proposed for the distribution of public keys:
CERTIFICATES “a document containing a certified statement, especially as to the truth of something ”
Key Distribution CS 470 Introduction to Applied Cryptography
Computer Science Public Key Management Lecture 5.
Digital Signature Xiaoyan Guo/ Xiaohang Luo/
14 May 2002© TrueTrust Ltd1 Privilege Management in X.509(2000) David W Chadwick BSc PhD.
Chapter 5 Digital Signatures MSc. NGUYEN CAO DAT Dr. TRAN VAN HOAI 1.
Identity Based Encryption Debdeep Mukhopadhyay Associate Professor Dept of Computer Sc and Engg, IIT Kharagpur.
Secure Electronic Transaction (SET)
Cryptography and Network Security Chapter 14 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
_______________________________________________________________________________________________________________ E-Commerce: Fundamentals and Applications1.
Configuring and Troubleshooting Identity and Access Solutions with Windows Server® 2008 Active Directory®
Information Security Fundamentals Major Information Security Problems and Solutions Department of Computer Science Southern Illinois University Edwardsville.
02/22/2005 Joint Seminer Satoshi Koga Information Technology & Security Lab. Kyushu Univ. A Distributed Online Certificate Status Protocol with Low Communication.
Cryptography Encryption/Decryption Franci Tajnik CISA Franci Tajnik.
Unit 1: Protection and Security for Grid Computing Part 2
Chapter 23 Internet Authentication Applications Kerberos Overview Initially developed at MIT Software utility available in both the public domain and.
Certificate-Based Operations. Module Objectives By the end of this module participants will be able to: Define how cryptography is used to secure information.
CERTIFICATES. What is a Digital Certificate? Electronic counterpart to a drive licenses or a passport. Enable individuals and organizations to secure.
WISTP’08 ©LAM /05/2008 A Self-Certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup Christer Andersson Markulf Kohlweiss.
X.509 Topics PGP S/MIME Kerberos. Directory Authentication Framework X.509 is part of the ISO X.500 directory standard. used by S/MIME, SSL, IPSec, and.
Cryptography and Network Security Chapter 14 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
Brian A. LaMacchia Director, XCG Security & Cryptography, Microsoft Research.
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,
Security fundamentals Topic 5 Using a Public Key Infrastructure.
Cryptography and Network Security Chapter 14
Key Management. Authentication Using Public-Key Cryptography  K A +, K B + : public keys Alice Bob K B + (A, R A ) 1 2 K A + (R A, R B,K A,B ) 3 K A,B.
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
1 An Ordered Multi-Proxy Multi-Signature Scheme Authors: Min-Shiang Hwang, Shiang-Feng Tzeng, Shu-Fen Chiou Speaker: Shu-Fen Chiou.
1 Certification Issue : how do we confidently know the public key of a given user? Authentication : a process for confirming or refuting a claim of identity.
1 Public Key Infrastructure Dr. Rocky K. C. Chang 25 February, 2002.
Self-Blindable Credential Certificates from the Weil Pairing Eric R. Verheul April 9, 2004 SCLab Jinhae Kim.
ICICS2002, Singapore 1 A Group Signature Scheme Committing the Group Toru Nakanishi, Masayuki Tao, and Yuji Sugiyama Dept. of Communication Network Engineering.
Pertemuan #8 Key Management Kuliah Pengaman Jaringan.
Chapter 5 Network Security Protocols in Practice Part I
Theft-protected Proprietary Certificates
Cryptography and Network Security
Information Security message M one-way hash fingerprint f = H(M)
کاربرد گواهی الکترونیکی در سیستمهای کاربردی (امضای دیجیتال)
Digital Certificates and X.509
PKI (Public Key Infrastructure)
Presentation transcript:

A Simple Traceable Pseudonym Certificate System for RSA-based PKI SCGroup Jinhae Kim

Introduction  Digital certificate –an authorized assertion about a public key –Holder can prove the related ownership by using a corresponding private key –The current PKI: privacy-intrusive Can be linked and traced  Pseudonym certificate –Identifiable by a pseudonym only –Digital certificate contains pseudonym as a subject identifier –Can be used in anonymous transaction

Building Blocks  PKI  RSA  Pseudonym  Blind signature  Threshold cryptography  X.509 certificate

Basic Model Anonymous Issuer (AI) Blind Issuer (BI) Issuer (PI) iv... UserCA Site 1Site n... iii ii i

Basic Model – cnt’d I.User U holds a digital certificate issued by CA  Using a real identity II.User can access service providers SP s III.SP asks revocation of a certificate to PI  PI: pseudonym certificate issuer (AI and BI) IV.AI and BI collaborate to link ID U and PN U  ID U : real identity of user U  PN U : pseudonym of user U

Traceable Pseudonym Certificates Version 3 SN RSA PI * * * Extensions Version Serial Number Signature Algorithm ID Issuer Name Validity Period Subject Name Subject Public Key Info. Extensions Version 3 SN RSA PI Validity Period PN ppk U, SIG PN Extensions Critical: ( C i ), * Critical: ( C 1, C 2, …, C m ) (a) x.509 v3 Certificate (c) Traceable Pseudonym Certificate (b) Pseudonym Certificate Skeleton

Basic Protocol - I  Basic Assumption –CA and PS’s authentic public keys are respectively available. –User U holds a real identity certificate denoted by {ID U, pk U } SIG CA –RSA private exponent d of PI is split by d 2 for AI and d 1 for BI (In case of single BI)  AI can control and verify the contents of a pseudonym certificate  BI can verify the user’s real identity

Basic Protocol - II 1.U → AI: Skeleton Request  Option: U can submit her basic information, so that AI can choose an appropriate BI  AI stores certificate skeleton with index SN 2.AI → U: Certificate Skeleton  b ←  M ←  h = H(M)  u = h r e, r: random number 3.U → BI: {ID U, pk U } SIG CA,{{u} SIG U, ρ} ENC BI  BI verifies {ID U, pk U } SIG CA under pk CA asdf  Decrypt {{u} SIG U, ρ} ENC BI verify u under pk U  Record  Compute w = u d1 mod N

Basic Protocol - III 4.BI → U: {w} ENC AI  ρ  U decrypts {w} ENC AI under ρ  Computes {{M} SIG PN, r, {w} ENC AI } ENC AI 5.U → AI: {{M} SIG PN, r, {w} ENC AI } ENC AI  Verify {M} SIG PN under ppk U and compare this with record corresponding SN  Compute z = w d 2 mod N  Check z r -1 mod N under  Record  Send z 6.AI → U: z  Compute z r -1 mod N to recover h d mod N  Verify h d mod N under  Traceable pseudonym certificate:

Pseudonym Revocation and Trace  SP asks revocation of a certain Pseudonym to AI –Submit the PN U to AI  AI retrieve –Recover z and send it to BI  BI obtain a real identity ID U –u = z e mod N –From can find ID U  Revoke all pseudonyms of a user U’ –BI retrieve all records –Send u d 1 mod N to AI securely –AI raises d 2 to get z and retrieve all pseudonyms of U’

Extended Protocols  Threshold Schemes –In case of multiple BI’s –Apply an RSA (L, k)-threshold signature scheme  Re-blinding Variants –Disable the tracing ability (e.g., e-voting)  Selective Credential Show –User’s digital credential: Flag: 0 – mandatory, 1 – selective h(c i ) : hash value of credential c i –PI should certify all semi-records of which flag is 0, but a hashed value only for flag is 1

Conclusion  Can be used on existing PKIs without requiring additional crypto modules  Fully compatible with X.509 certificates  Simple and efficient with versatile privacy-enhancing features  Choice from traceability and absolute anonymity  Threshold variants for more secure applications

References  Yongdae Kim, et al. “A Simple Traceable Pseudonym Certificate System for RSA-based PKI”  D. Chaum, “Security without identification: Transactions systems to make big brother obsolete,” Communications of the ACM, vol. 28, no. 10, pp  X.509, “Information technology – Open Systems Interconnection – The Directory: Public-key and attribute certificate frameworks,” ITU-T Recommendation X.509