Presentation on theme: "October 2006Pairing Based Cryptography Workshop Melbourne1 PKI Problems – ID-based Solutions? Kenny Paterson Information Security Group Royal Holloway,"— Presentation transcript:
October 2006Pairing Based Cryptography Workshop Melbourne1 PKI Problems – ID-based Solutions? Kenny Paterson Information Security Group Royal Holloway, University of London
October 2006Pairing Based Cryptography Workshop Melbourne2 Overview Part 1: Public key cryptography (PKC) and public key infrastructures (PKIs). –The need for PKI. –PKI components. –Problems of PKI. Part 2: Identity-based public key cryptography (ID- PKC). –History and function. –Applications. –Practical issues.
October 2006Pairing Based Cryptography Workshop Melbourne3 Public Key Cryptography (PKC) Also known as asymmetric cryptography. Each user has two keys: public and private. Alice's public key typically used for: –encryption to Alice by Bob. –verification of Alice's signatures by Bob. Alice's private key typically used for: –decryption by Alice. –signing by Alice. No need for Alice and Bob to share a common key before they begin secure communications! –Compare with symmetric key cryptography.
October 2006Pairing Based Cryptography Workshop Melbourne4 The Need for PKI We need some way of enabling Bob to actually find Alice’s key. –A directory service for encryption applications. –Or delivered as part of a protocol, or along with a signature. But how does Bob know that Alice's public key really is Alice's (and not Eve's)? –We need some way of binding public keys with identities. –Certificates in most circumstances. We will also need some way of signalling that a public key is no longer to be relied upon. –Alice’s private key might become exposed, or she might change roles or leave the company. –A revocation mechanism.
October 2006Pairing Based Cryptography Workshop Melbourne5 Public Key Infrastructures Definition: A Public Key Infrastructure (PKI) is any system supporting the deployment of Public Key Cryptography By the term “traditional PKI” we mean: –a combination of hardware, software and policies; –needed to deploy and manage certificates; –to produce trust in public keys; –used in a particular application or set of applications.
October 2006Pairing Based Cryptography Workshop Melbourne6 PKI Components Registration Authority (RA). –Authenticates individuals/entities, optionally checks for possession of private key matching public key. –Passes off result to Certification Authority. Certification Authority (CA). –Issues certificates: CA issues signatures binding public keys and identities. –Relying parties need authentic copy of CA’s public key… Directory Service. –Directory of public keys/certificates. Revocation Service. –May involve distribution of Certificate Revocation List (CRL) or on-line certificate status checking (OCSP).
October 2006Pairing Based Cryptography Workshop Melbourne7 Using PKI RACA Key Pair “Issue Cert” Directory CRL
October 2006Pairing Based Cryptography Workshop Melbourne8 Example PKIs SSL server certificates, authenticated via root certificate embedded in browser. –Certificate hierarchy. –Provides server (not client!) authentication for e-commerce. –Rare example of “open” PKI. IPSec certificates. –Gateway-gateway VPN and remote access solutions. –PKC enables authentication of endpoints via IKE protocol. –Generally closed PKI.
October 2006Pairing Based Cryptography Workshop Melbourne9 Example PKIs Identrus PKI. –Trust for b2b commerce, banks acting as CAs. –Complicated set of rules and contracts needed to define roles, responsibilities and liabilities. –Closed PKI. Web of trust in PGP versus traditional PKI for S/MIME secure . –Not all PKIs are traditional PKIs!
October 2006Pairing Based Cryptography Workshop Melbourne10 Some PKI Problems Infrastructure should be largely invisible, but PKI often isn’t. Especially acute where consumers/end-user populations (humans) are involved: –Costs of large scale user registration. –Need for appropriate protection of end-user private keys. –End-users often presented with certificate pop-ups. –How many extra mouse-clicks to secure an ? –Cryptography and user interface design are miles apart. –Management of digital identity still a novelty for many users. –“Why Johnny Can’t Encrypt”, Whitten and Tygar, USENIX Security Symposium, 1999.
October 2006Pairing Based Cryptography Workshop Melbourne11 Some PKI Problems Legal and regulatory To what extent can a party actually rely on a digital signature in, for example, a high-value business transaction? What recourse to law does the relying party have when something goes wrong? How much liability is borne by the CA/RA and how much by the relying party? How can end-users/customers be made aware of any liability limitations? What are the legal implications of hierarchies and cross-certification?
October 2006Pairing Based Cryptography Workshop Melbourne12 More PKI Problems Interoperability and standards –Over-flexibility of X.509 certificate standard. –Standards often by-passed to get the job done. –Multiple vendors with incompatible products. Costs and business models –How to make money running a CA? –How to make the business case for deploying PKI? How to persuade management of need for further infrastructure deployment? How to measure return-on-investment for PKI? Is out-sourced PKI a useful approach? Which PKI vendor should I use?
October 2006Pairing Based Cryptography Workshop Melbourne13 Yet More PKI Problems Some technical issues: How is revocation to be handled? –Are Certificate Revocation Lists (CRLs) adequate, or is real- time certificate status required? –How will CRLs be distributed? How often? –What extra infrastructure would be needed to support on-line certificate status protocol (OCSP)? How should the CA be designed and run? –Physical security, access, availability, policy, procedures, staffing, generation and storage of CA signing keys,… How should keys and algorithms be managed? –lifetime of keys, cryptographic strength of algorithms, certificate rollover issues
October 2006Pairing Based Cryptography Workshop Melbourne14 Complexity and PKI There is a massive complexity gap between the concept of public key cryptography and its realisation in the form of a traditional PKI From an application perspective, the ability to provide non-repudiation seems to be the unique feature separating public key from symmetric key. –Once one appreciates the real-world complexities, symmetric key systems appear equally attractive in many circumstances! Certificates and their management are the source of some problems –So somehow getting rid of certificates might help?
October 2006Pairing Based Cryptography Workshop Melbourne15 Part 2 – Identity-based Cryptography Original idea due to Shamir (1984): Public keys derived directly from system identities (e.g. an address or IP address). Private keys generated and distributed to users in by a trusted authority (TA) who has a master key. As long as: –Bob is sure of Alice’s identity and. –The TA has given the private key to the right entity, then Bob can safely encrypt to Alice without consulting a directory and without checking a certificate.
October 2006Pairing Based Cryptography Workshop Melbourne16 Identity-based Cryptography TA Private Key Alice’s ID Public Key
October 2006Pairing Based Cryptography Workshop Melbourne17 Identity-based Cryptography Apparently, elimination of certificates produces a far simpler infrastructure. –We’ll examine this in more detail soon. Identifier often used in place of identity. –Reflecting idea that any string can be used to derive public keys. IBE = Identity/Identifier-based encryption. ID-PKE = ID-based public key encryption. ID-PKC = ID-based public key cryptography.
October 2006Pairing Based Cryptography Workshop Melbourne18 IBE – A Short History Shamir devised only an ID-based signature scheme. Construction of truly practical and secure ID-based encryption scheme an open problem until –Several insecure/inefficient proposals. –Example: Maurer-Yacobi dependent on gap in hardness between factoring n=pq and solving DLP modulo p and q.
October 2006Pairing Based Cryptography Workshop Melbourne19 IBE – A Short History Sakai, Ohgishi and Kasahara (SCIS, Jan. 2001) –Written in Japanese. –Pairing-based IBE scheme, but no security model or proofs. Boneh and Franklin (Crypto, August 2001) –Written in English. –Pairing-based IBE scheme, practical and provably secure. Cocks’ scheme (IMA Conference, Dec. 2001) –IBE scheme based on quadratic residuosity, not bandwidth efficient. –Research done in mid 1990’s at UK government agency.
October 2006Pairing Based Cryptography Workshop Melbourne20 Apparent Benefits of ID-PKC Certificate-free. –No production, checking, management or distribution of certificates. Directory-less. –Bob can encrypt for Alice without looking-up Alice’s public key first. –Indeed, Alice need not have her private key when she receives Bob’s encryption.
October 2006Pairing Based Cryptography Workshop Melbourne21 Apparent Benefits of ID-PKC Automatic revocation. –Simply extend identifier to include a validity period. –Alice’s private key becomes useless at end of each period. –Alice needs to obtain private key for current period in order to decrypt new messages. –No need for CRLs or OCSP. Built-in support for key recovery. –TA can calculate private key for any user. –May be needed, for example, when user leaves the organisation. –Also enables applications like content scanning of at server.
October 2006Pairing Based Cryptography Workshop Melbourne22 Applications of ID-PKC ID-PKC and pairing-based crypto have undergone an extraordinarily rapid development since –Boneh-Franklin has 800 citations on Google scholar. –Growing commercial interest. We examine some potential applications for ID-PKC. –Secure . –Cryptographic workflow. –Domain-based security. –GRID security infrastructure. Many other applications have been proposed.
October 2006Pairing Based Cryptography Workshop Melbourne23 ID-PKC and Secure ID-PKC seems well-suited to encryption for and other messaging technologies in corporate environments. –There is a natural candidate for TA. –Low interaction with infrastructure for sender. –Recipient of encrypted need not be pre-enrolled. –Key recovery feature allows message hygiene services to be conducted at mail server/organisational boundary. –Potential for lower costs through lightweight infrastructure requirements (compared to PKI-based solution). –Seems likely to be first mass-market application of ID-PKC: –Voltage Security:
October 2006Pairing Based Cryptography Workshop Melbourne24 ID-PKC and Secure But… Difficult to build non-repudiation services without resorting to traditional PKI. May need to integrate with existing PKI-based authentication services. Voltage Security whitepaper, March 2005: -“Combining IBE with PKI enables a secure messaging environment to benefit from the advantages of both systems.”
October 2006Pairing Based Cryptography Workshop Melbourne25 Cryptographic Workflow Identifier could be any string. Public key can be determined before private key. –Bob selects identifier string expressing a policy. –Bob encrypts message of value to Alice using public key matching the identifier. –Bob relies on TA to only release matching private key if conditions expressed in policy met by Alice. TA becomes a decryption policy enforcement point.
October 2006Pairing Based Cryptography Workshop Melbourne26 Cryptographic Workflow TA policy Encrypted message policy message
October 2006Pairing Based Cryptography Workshop Melbourne27 Example of Workflow Bob selects identifier for Alice: Identifier = “Alice && over 18 && transaction value < $100”. Bob sends Alice content encrypted under public key derived from this identifier. Alice convinces TA she satisfies conditions expressed in the identifier – age and limit on transaction value. –Or multiple TAs, once for each condition. TA then gives Alice private key matching identifier. Finally, Alice can decrypt to obtain content.
October 2006Pairing Based Cryptography Workshop Melbourne28 Workflow Using PKI Cryptographic workflow is a nice idea, but it doesn’t actually require ID-PKC … –TA has become policy enforcer, trusted to perform certain actions. –Now high degree of interaction between Alice and TA. Each new policy is likely to be unique and require fresh private key. Alternative approach with same trust assumptions and message flows: –Bob encrypts content under TTP’s (ordinary) public key and sends to Alice along with policy for decryption. –Alice takes encrypted content to TTP who decrypts it for Alice, provided Alice satisfies policy.
October 2006Pairing Based Cryptography Workshop Melbourne29 Domain-based Security Smetters and Durfee, 12 th USENIX Security Symposium, 2003: –Each DNS domain acts as TA for clients in the domain. –Use DNSSEC PKI to authenticate TA parameters. Adapt DNS to transport TA public parameters between domains. Support for inter- and intra-domain IP and security. –Various mechanisms for private key distribution including: SSL (possibly with client certificates based on PKI!). Distribution via to authenticate clients. Or transmission over trusted network segment. –Proof of concept coded in Java on Linux.
October 2006Pairing Based Cryptography Workshop Melbourne30 Grid Security Lim and Paterson, 1 st IEEE International Conference on e-Science and Grid Computing, –Pure-ID-PKC architecture designed to meet security requirements for GRIDs: Single Sign-On. Delegation via proxying. Secure channels. –Use of hierarchical ID-PKC to handle hierarchy of root TA, local TA, user, and user proxy. –Exploit identifiers to specify delegation policies, reduce round-trips and ease revocation. –Select parameters to minimise computation and bandwidth.
October 2006Pairing Based Cryptography Workshop Melbourne31 Practical Issues for ID-PKC We have focused so far on positive aspects of ID- PKC: –Certificate-free, –Directory-less, –Automatic revocation, –Support for key recovery. We next examine the practical issues associated with ID-PKC.
October 2006Pairing Based Cryptography Workshop Melbourne32 Public Parameters Bob needs an authentic copy of the TA’s public parameters before he can safely encrypt to Alice. –To prevent man-in-middle attacks. One solution is to hard-code TA parameters into client applications. –May work for closed applications, but not very flexible. –Could use hierarchical approach to support multiple applications and parties. Another solution: –Certify TA parameters using a PKI. –A hybrid solution, as adopted by Smetters and Durfee. –Still need to distribute and check these certified parameters.
October 2006Pairing Based Cryptography Workshop Melbourne33 Registration A secure enrollment process is still needed. –Pre-enrollment can be avoided, but Alice does need to enroll at some point! –A secure process is needed to ensure that Alice’s private key is really being delivered to Alice. PKI only needs an authentic channel. ID-PKC needs a channel that is both authentic and confidential.
October 2006Pairing Based Cryptography Workshop Melbourne34 Registration A secure channel is needed for registration and delivery of private keys. –How is this to be achieved in practice? –How often will the channel be used? –What security level does it need to provide? For example, is delivery via appropriate? –If we have such a channel, what alternative uses might be found for it? –Where should we store private keys once we’ve distributed them?
October 2006Pairing Based Cryptography Workshop Melbourne35 Reality of ID-based Cryptography TA Secure channel Authentic public parameters Alice’s ID
October 2006Pairing Based Cryptography Workshop Melbourne36 Effect of Catastrophic Compromise What is the cost of compromise of the master secret? Potentially higher than cost of compromise of CA signing key in PKI: –CA in PKI could re-issue all certificates under new signing key. –No client private keys are compromised. –Only temporary exposure to threat of rogue certificates being used by encrypting/verifying party. –Meanwhile, in ID-PKC, all past encrypted messages are exposed and all old signatures become worthless.
October 2006Pairing Based Cryptography Workshop Melbourne37 Key Escrow An inevitable consequence of the key recovery feature: TA can calculate all the private keys in the system. So need to trust TA not to abuse this privilege. PKI is more flexible in this respect. May limit applicability of ID-PKC to certain applications where some degree of trust in TA is inherent. –E.g. Secure corporate system.
October 2006Pairing Based Cryptography Workshop Melbourne38 Inability to Provide Non-repudiation Another consequence of key escrow. TA could forge signatures if an ID-based signature were adopted. –So need to trust TA not to do that. EU electronic signature legislation requires private key to be under “sole control” of signer in order for signatures to be fully recognised. –So key escrow feature may be incompatible with some legislative regimes. Since a certificate can always be sent along with a signature, ID-PKC does not seem to have a big advantage over PKI here anyway.
October 2006Pairing Based Cryptography Workshop Melbourne39 Revocation in ID-PKC Revisited A revocation mechanism is needed in ID-PKC just as in traditional PKI. –In event of key compromise or change of status of entity related to identifier. –But how can you revoke an identifier? The simple “automatic revocation” solution: –Bob simply extend Alice’s identifier to include a validity period. –Granularity of expiry times determines rate of private key issuance (yearly, weekly, daily,…). –Could conveniently specify expiry policy in TA’s parameters. Hence “no need for CRLs or OCSP”.
October 2006Pairing Based Cryptography Workshop Melbourne40 Revocation in ID-PKC Revisited Validity period also determines maximum exposure time between compromise of private key and update of public key. So higher security application would need shorter validity period and hence higher rate of private key issuance. –Extra workload on TA. –TA may need to be highly available. –Secure channel needs to be used at frequent intervals.
October 2006Pairing Based Cryptography Workshop Melbourne41 Revocation in ID-PKC Revisited Real-time information concerning status of identifiers/private keys may be needed in some high- security applications, –E.g. Authenticating high-value electronic transactions. Then an OCSP-like solution will be required.
October 2006Pairing Based Cryptography Workshop Melbourne42 Reality of Revocation in ID-PKC The reality: Any public key technology needs some kind of mechanism to revoke public keys. An effective revocation mechanism requires the timely distribution of authentic status information. –Degree of timeliness depends on security level of application. The automatic revocation mechanism may not always be appropriate for ID-PKC.
October 2006Pairing Based Cryptography Workshop Melbourne43 Complexity and ID-PKC There is a complexity gap between the concept of ID- PKC and its realisation in real-world applications. –Doesn’t this sound familiar? This makes certain initially attractive applications less compelling in practice. Getting rid of certificates helps. –But perhaps not as much as we’d like to believe!
October 2006Pairing Based Cryptography Workshop Melbourne44 Summary Traditional PKI has well documented problems. –Many of them not technology-related. Identity-based cryptography as an alternative approach gaining in popularity. –Solves some problems but introduces others. –Well suited to “corporate” or domain-restricted/closed applications where there is a natural choice for the TA. –Commercial deployment beginning.
October 2006Pairing Based Cryptography Workshop Melbourne45 Acknowledgements Talk based on joint research over last few years with: Sattam Al-Riyami, Hoon Wei Lim, Fred Piper, Geraint Price. PKI club: a research forum sponsored by Abbey, APACS, Barron McCann, beTRUSTed, BT exact Technologies, CESG, Hewlett-Packard Laboratories Bristol, Indicii Salus, Mondex and Prudential. –http://www.isg.rhul.ac.uk/research/projects/pkiclub
October 2006Pairing Based Cryptography Workshop Melbourne46 Alternative Infrastructures Certificate-based encryption (CBE). –Simplifies revocation in traditional PKIs. Certificateless public key cryptography (CL-PKC). –A third paradigm for generating trust in public keys. –Lies midway between traditional PKI and ID-PKC in terms of trust model and functionality.
October 2006Pairing Based Cryptography Workshop Melbourne47 Certificate-based Encryption Introduced by Gentry (Eurocrypt 2003). Simplifies revocation in traditional PKIs. Alice’s private key consists of two components: –The private part S A of a “traditional” key pair (S A,P A ). –A time-dependent certificate S CA (t) pushed to Alice on a regular basis by the CA, so long as Alice not revoked. Bob can compute a matching public key using only the CA’s public parameters, time t and Alice’s public component P A. Bob is assured that Alice can only decrypt if the CA has issued certificate S CA (t) for the current time interval t. Simplicity of revocation traded for requirement on CA to regularly push certificates.
October 2006Pairing Based Cryptography Workshop Melbourne48 Certificate-based Encryption (CBE) Key “Pair” CA public parameters S CA (t) PAPA + PAPA S A + S CA (t) t CA
October 2006Pairing Based Cryptography Workshop Melbourne49 Certificateless Public Key Cryptography (CL-PKC) Introduced by Al-Riyami and Paterson (Asiacrypt 2003). –Now a thriving sub-area of ID-PKC. Design objective: –Remove the key escrow inherent in ID-PKC without introducing certificates. CL-PKE: certificateless public key encryption. –TA-generated partial private key PPK A combined with user- generated secret x A to form private key S A. –User secret x A determines public key P A. –TA public parameters, public key P A and identifier ID A used for encryption.
October 2006Pairing Based Cryptography Workshop Melbourne50 CL-PKE Key Pair TA public parameters PPK A PAPA TA xAxA PAPA SASA ID A ‘Encryption Key’
October 2006Pairing Based Cryptography Workshop Melbourne51 CL-PKE Features No key escrow. –User-generated secret component x A protects against eavesdropping TA. No explicit certification of public keys required. –So must consider adversary who can replace public keys. –But adversary does not know partial private key PPK A, so cannot calculate full private key. –Explicit assumption is needed that TA does not engage in active adversarial behaviour. CL-PKE supports cryptographic workflow through choice of identifiers. A complete suite of certificateless cryptographic primitives is available. –Signatures, key exchange protocols, hierarchical schemes. CL-PKE closely related to CBE; concepts developed independently.
October 2006Pairing Based Cryptography Workshop Melbourne52 CL-PKC Drawbacks No longer purely identity-based. –Identifier and public key needed for encryption. Secure channel needed for delivery of partial private keys – as in ID-PKC. Does not attain full security of traditional PKI, since TA might cheat. –But TA must mount active attack (replacing public keys), whereas in ID-PKC, only passive attack by TA needed.