Jump to content

Digital credential

Add links
From Wikipedia, the free encyclopedia

Digital credentials are the digital equivalent of paper-based credentials. Just as a paper-based credential could be a passport, a driver's license, a membership certificate or some kind of ticket to obtain some service, such as a cinema ticket or a public transport ticket, a digital credential is a proof of qualification, competence, or clearance that is attached to a person. Also, digital credentials prove something about their owner. Both types of credentials may contain personal information such as the person's name, birthplace, birthdate, and/or biometric information such as a picture or a finger print.

Because of the still evolving, and sometimes conflicting, terminologies used in the fields of computer science, computer security, and cryptography, the term "digital credential" is used quite confusingly in these fields. Sometimes passwords or other means of authentication are referred to as credentials. In operating system design, credentials are the properties of a process (such as its effective UID) that is used for determining its access rights. On other occasions, certificates and associated key material such as those stored in PKCS#12 and PKCS#15 are referred to as credentials.

Digital badges are a form of digital credential that indicate an accomplishment, skill, quality or interest. Digital badges can be earned in a variety of learning environments.[1]

Digital cash

[edit]

Money, in general, is not regarded as a form of qualification that is inherently linked to a specific individual, as the value of token money is perceived to reside independently. However, the emergence of digital assets, such as digital cash, has introduced a new set of challenges due to their susceptibility to replication. Consequently, digital cash protocols have been developed with additional measures to mitigate the issue of double spending, wherein a coin is used for multiple transactions.

Credentials, on the other hand, serve as tangible evidence of an individual's qualifications or attributes, acting as a validation of their capabilities. One notable example is the concept of E-Coins, which are exclusively assigned to individuals and are not transferable to others. These E-Coins can only be utilised in transactions with authorised merchants. Anonymity is maintained for individuals as long as they ensure that a coin is spent only once. However, if an individual attempts to spend the same coin multiple times, their identity can be established, enabling the bank or relevant authority to take appropriate actions.[2]

The shared characteristic of being tied to an individual forms the basis for the numerous similarities between digital cash and digital credentials. This commonality explains why these two concepts often exhibit overlapping features. In fact, it is worth noting that a significant majority of implementations of anonymous digital credentials also incorporate elements of digital cash systems.[2]

Anonymous

[edit]

The concept of anonymous digital credentials centres around the provision of cryptographic tokens to users, enabling them to demonstrate specific statements about themselves and their associations with public and private organizations while maintaining anonymity. This approach is viewed as a privacy-conscious alternative to the storage and utilization of extensive centralized user records, which can be linked together. Anonymous digital credentials are thus related to privacy and anonymity.[3]

Analogous to the physical world, personalised or non-anonymous credentials include documents like passports, driving licenses, credit cards, health insurance cards, and club membership cards. These credentials bear the owner's name and possess certain validating features, such as signatures, PINs, or photographs, to prevent unauthorised usage. In contrast, anonymous credentials in the physical realm can be exemplified by forms of currency, bus and train tickets, and game-arcade tokens. These items lack personally identifiable information, allowing for their transfer between users without the issuers or relying parties being aware of such transactions. Organizations responsible for issuing credentials verify the authenticity of the information contained within them, which can be provided to verifying entities upon request.[4]

To explore the specific privacy-related characteristics of credentials, it is instructive to examine two types of credentials: physical money and credit cards. Both facilitate payment transactions effectively, although the extent and quality of information disclosed differ significantly. Money is safeguarded against counterfeiting through its physical properties. Furthermore, it reveals minimal information, with coins featuring an inherent value and year of minting, while banknotes incorporate a unique serial number to comply with traceability requirements for law enforcement purposes.[5]

In contrast, the usage of credit cards, despite sharing a fundamental purpose with money, allows for the generation of detailed records pertaining to the cardholder. Consequently, credit cards are not considered protective of privacy. The primary advantage of money, in terms of privacy, is that its users can preserve their anonymity. However, real-world cash also possesses additional security and usability features that contribute to its widespread acceptance.[6]

Credentials utilised within a national identification system are particularly relevant to privacy considerations. Such identification documents, including passports, driver's licenses, or other types of cards, typically contain essential personal information. In certain scenarios, it may be advantageous to selectively disclose only specific portions of the information contained within the identification document. For example, it might be desirable to reveal only the minimum age of an individual or the fact that they are qualified to drive a car.[7]

Pseudonyms

[edit]

The original system of anonymous credentials, initially proposed by David Chaum[8] is sometimes referred to as a pseudonym system.[9] This nomenclature arises from the nature of the credentials within this system, which are acquired and presented to organizations under distinct pseudonyms that cannot be linked together.

The introduction of pseudonyms[8] is a useful extension to anonymity. Pseudonyms represent a valuable expansion of anonymity. They afford users the ability to adopt different names when interacting with each organization. While pseudonyms enable organizations to establish associations with user accounts, they are unable to ascertain the true identities of their customers. Nonetheless, through the utilisation of an anonymous credential, specific assertions concerning a user's relationship with one organization, under a pseudonym, can be verified by another organization that only recognizes the user under a different pseudonym.

History

[edit]

Anonymous credential systems have a close connection to the concept of untraceable or anonymous payments.[10] David Chaum made significant contributions to this field by introducing blind signature protocols as a novel cryptographic primitive. In such protocols, the signer remains oblivious to the message being signed, while the recipient obtains a signature without any knowledge of the signed message. Blind signatures serve as a crucial building block for various privacy-sensitive applications, including anonymous payments, voting systems, and credentials. The original notion of an anonymous credential system[8] was derived from the concept of blind signatures but relied on a trusted party for the transfer of credentials, involving the translation from one pseudonym to another. Chaum's blind signature scheme, based on RSA signatures and the discrete logarithm problem, enabled the construction of anonymous credential systems.

Stefan Brands further advanced digital credentials by introducing secret-key certificate-based credentials, enhancing Chaum's basic blind-signature system in both the discrete logarithm and strong RSA assumption settings. Brands credentials offer efficient algorithms and unconditional commercial security in terms of privacy,[11] along with additional features like a proof of non-membership blacklist.[12]

Another form of credentials that adds a new feature to anonymous credentials is multi-show unlinkability, which is realized through group signature related credentials of Camenisch et al. The introduction of Group signatures possibilities for multi-show unlinkable showing protocols. WWhile blind signatures are highly relevant for electronic cash and single-show credentials, the cryptographic primitive known as group signature introduced new avenues for constructing privacy-enhancing protocols.[13] Group signatures share similarities with Chaum's concept of credential systems.[8]

In a group signature scheme, members of a group can sign a message using their respective secret keys. The resulting signature can be verified by anyone possessing the common public key, without revealing any information about the signer other than their group membership. Typically, a group manager entity exists, capable of disclosing the actual identity of the signer and managing the addition or removal of users from the group, often through the issuance or revocation of group membership certificates. The anonymity, unlinkability, and anonymity revocation features provided by group signatures make them suitable for various privacy-sensitive applications, such as voting, bidding, anonymous payments, and anonymous credentials.

Efficient constructions for group signatures were presented by Ateniese, Camenisch, Joye, and Tsudik[14] while the most efficient multi-show unlinkable anonymous credential systems[15]]—with the latter being a streamlined version of idemix[[16]]—are based on similar principles.[17] This is particularly true for credential systems that provide efficient means for implementing anonymous multi-show credentials with credential revocation.[18]

Both schemes are based on techniques for doing proofs of knowledge.[19][20] Proofs of knowledge based on the discrete logarithm problem for groups of known order and the special RSA problem for groups of hidden order form the foundation for most modern group signature and anonymous credential systems.[12][14][15][21] Moreover, the direct anonymous attestation, a protocol for authenticating trusted platform modules, is also based on the same techniques.

Direct anonymous attestation can be considered the first commercial application of multi-show anonymous digital credentials, although in this case, the credentials are associated with chips and computer platforms rather than individuals.

From an application perspective, the main advantage of Camenisch et al.'s multi-show unlinkable credentials over the more efficient Brands credentials is the property of multi-show unlinkability. However, this property is primarily relevant in offline settings. Brands credentials offer a mechanism that provides analogous functionality without sacrificing performance: an efficient batch issuing protocol capable of simultaneously issuing multiple unlinkable credentials. This mechanism can be combined with a privacy-preserving certificate refresh process, which generates a fresh unlinkable credential with the same attributes as a previously spent credential.

Online credentials for learning

[edit]
Main article: Online credentials for learning

Online credentials for learning are digital credentials that are offered in place of traditional paper credentials for a skill or educational achievement. Directly linked to the accelerated development of internet communication technologies, the development of digital badges, electronic passports and massive open online courses [22](MOOCs) have a very direct bearing on our understanding of learning, recognition and levels as they pose a direct challenge to the status quo. It is useful to distinguish between three forms of online credentials: Test-based credentials, online badges, and online certificates.[23]

See also

[edit]

Sources

[edit]

 This article incorporates text from a free content work. Licensed under CC-BY-SA IGO 3.0 (license statement/permission). Text taken from Level-setting and recognition of learning outcomes: The use of level descriptors in the twenty-first century​, 129-131, Keevey, James; Chakroun, Borhene, UNESCO. UNESCO.

References

[edit]
  1. ^ "A Future Full of Badges". The Chronicle of Higher Education. 8 April 2012.
  2. ^ a b Paolucci, Beatrice (9 December 2022). "The Future of Digital Money". IBM Blog. Retrieved 24 May 2023.
  3. ^ "PRIME Whitepaper: privacy enhanced identity management" (PDF). PRIME. 27 June 2007. Archived from the original (PDF) on 17 August 2007. Retrieved 28 June 2007.
  4. ^ "PRIME Whitepaper: privacy enhanced identity management" (PDF). PRIME. 27 June 2007. Archived from the original (PDF) on 17 August 2007. Retrieved 28 June 2007.
  5. ^ "PRIME Whitepaper: privacy enhanced identity management" (PDF). PRIME. 27 June 2007. Archived from the original (PDF) on 17 August 2007. Retrieved 28 June 2007.
  6. ^ "PRIME Whitepaper: privacy enhanced identity management" (PDF). PRIME. 27 June 2007. Archived from the original (PDF) on 17 August 2007. Retrieved 28 June 2007.
  7. ^ "PRIME Whitepaper: privacy enhanced identity management" (PDF). PRIME. 27 June 2007. Archived from the original (PDF) on 17 August 2007. Retrieved 28 June 2007.
  8. ^ a b c d Chaum, David (October 1985). "Security without identification: transaction systems to make big brother obsolete". Communications of the ACM. 28 (10): 1030–1044. CiteSeerX 10.1.1.319.3690. doi:10.1145/4372.4373. S2CID 15340054.
  9. ^ Lysyanskaya, Anna; Rivest, Ronald L.; Sahai, Amit; Wolf, Stefan (2000). "Pseudonym systems". In Heys, Howard M.; Adams, Carlisle M. (eds.). Selected Areas in Cryptography. Lecture Notes in Computer Science. Vol. 1758. Springer. pp. 184–199. doi:10.1007/3-540-46513-8_14. ISBN 978-3-540-67185-5. S2CID 77189.
  10. ^ Chaum, David (1983). "Blind signatures for untraceable payments". In Chaum, David; Rivest, Ronald L.; Sherman, Alan T (eds.). Advances in Cryptology. CRYPTO '82. Plenum Press. pp. 199–203.
  11. ^ "Credentica".
  12. ^ a b Brands, Stefan A. (2000). Rethinking public key infrastructures and digital certificates. MIT Press. ISBN 978-0-262-02491-4.
  13. ^ Chaum, David; van Heyst, Eugene (1991). "Group signatures". In Davies, Donald W (ed.). Advances in Cryptology – EUROCRYPT '91. Lecture Notes in Computer Science. Vol. 547. Springer. pp. 257–265. doi:10.1007/3-540-46416-6_22. ISBN 978-3-540-54620-7.
  14. ^ a b Ateniese, Giuseppe; Camenisch, Jan; Joye, Marc; Tsudik, Gene (2000). "A practical and provably secure coalition-resistant group signature scheme". In Bellare, Mihir (ed.). Advances in Cryptology — CRYPTO 2000. Lecture Notes in Computer Science. Vol. 1880. Springer. pp. 255–270. doi:10.1007/3-540-44598-6_16. ISBN 978-3-540-67907-3.
  15. ^ a b Camenisch, Jan; Lysyanskaya, Anna (2001). "An efficient system for non-transferable anonymous credentials with optional anonymity revocation". In Pfitzmann, Birgit (ed.). Advances in Cryptology — EUROCRYPT 2001. Lecture Notes in Computer Science. Vol. 2045. Springer. pp. 93–118. doi:10.1007/3-540-44987-6_7. ISBN 978-3-540-42070-5.
  16. ^ "idemix- pseudonymity for e-transactions". IBM.
  17. ^ Camenisch, Jan; Lysyanskaya, Anna (2003). "A Signature Scheme with Efficient Protocols". In Cimato, Stelvio; Galdi, Clemente; Persiano, Giuseppe (eds.). Security in Communication Networks. Lecture Notes in Computer Science. Vol. 2576. Springer. pp. 268–289. CiteSeerX 10.1.1.186.5994. doi:10.1007/3-540-36413-7_20. ISBN 978-3-540-00420-2.
  18. ^ Camenisch, Jan; Lysyanskaya, Anna (2002). "Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials". In Yung, Moti (ed.). Advances in Cryptology — CRYPTO 2002. Lecture Notes in Computer Science. Vol. 2442. Springer. pp. 101–120. doi:10.1007/3-540-45708-9_5. ISBN 978-3-540-44050-5.
  19. ^ Bellare, Mihir; Goldreich, Oded (1993). "On Defining Proofs of Knowledge". In Brickell, Ernest F (ed.). Advances in Cryptology – CRYPTO '92. Lecture Notes in Computer Science. Vol. 740. Springer. pp. 390–420. doi:10.1007/3-540-48071-4_28. ISBN 978-3-540-57340-1.
  20. ^ Schnorr, Claus-Peter (January 1991). "Efficient signature generation by smart cards" (PDF). Journal of Cryptology. 4 (3): 161–174. doi:10.1007/BF00196725. S2CID 10976365.
  21. ^ Camenisch, Jan; Michels, Markus (1998). "A Group Signature Scheme with Improved Efficiency". In Kazuo Ohta; Dingyi Pei (eds.). Advances in Cryptology – ASIACRYPT '98. Lecture Notes in Computer Science. Vol. 1514. Springer. pp. 160–174. doi:10.1007/3-540-49649-1_14. ISBN 978-3-540-65109-3.
  22. ^ certifyMe.online. "Digital Credential Platform 𝟯 𝗳𝗮𝗰𝘁𝘀 about 𝗖𝗿𝗲𝗱𝗲𝗻𝘁𝗶𝗮𝗹". certifyMe.online. Retrieved 2021-11-01.
  23. ^ Keevy, James; Chakroun, Borhene (2015). Level-setting and recognition of learning outcomes: The use of level descriptors in the twenty-first century (PDF). Paris, UNESCO. pp. 129–131. ISBN 978-92-3-100138-3.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Digital_credential&oldid=1222484196"