Search references for IDENTITY BASED-CRYPTOGRAPHY. Phrases containing IDENTITY BASED-CRYPTOGRAPHY
See searches and references containing IDENTITY BASED-CRYPTOGRAPHY!IDENTITY BASED-CRYPTOGRAPHY
Identity-based cryptography is a type of public-key cryptography in which a publicly known string representing an individual or organization is used as
Identity-based_cryptography
Type of public-key encryption
Identity-based encryption (IBE), is an important primitive of identity-based cryptography. As such it is a type of public-key encryption in which the
Identity-based_encryption
SM9 is a Chinese national cryptography standard for Identity Based Cryptography issued by the Chinese State Cryptographic Authority in March 2016. It
SM9_(cryptography_standard)
Approach to public-key cryptography
Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC
Elliptic-curve_cryptography
Practice and study of secure communication techniques
non-repudiation) are also central to cryptography. Practical applications of cryptography include electronic commerce, chip-based payment cards, digital currencies
Cryptography
Project by NIST to standardize post-quantum cryptography
Post-Quantum Cryptography Standardization is a program and competition by NIST to update their standards to include post-quantum cryptography. It was announced
NIST Post-Quantum Cryptography Standardization
NIST_Post-Quantum_Cryptography_Standardization
Public-key cryptosystem
In cryptography, the ElGamal encryption system is a public-key encryption algorithm based on the Diffie–Hellman key exchange. It was described by Taher
ElGamal_encryption
Cryptography secured against quantum computers
Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms
Post-quantum_cryptography
Non-federated cryptographic protocol
Protocol (formerly known as the TextSecure Protocol) is a non-federated cryptographic protocol that provides end-to-end encryption for voice and instant messaging
Signal_Protocol
Mathematical scheme for verifying the authenticity of digital documents
known to the recipient. Digital signatures are a type of public-key cryptography, and are commonly used for software distribution, financial transactions
Digital_signature
Algorithm for public-key cryptography
cryptosystem) such as RSAES-OAEP, and public-key key encapsulation. In RSA-based cryptography, a user's private key—which can be used to sign messages, or decrypt
RSA_cryptosystem
System that can issue, distribute and verify digital certificates
to confirm the identity of the parties involved in the communication and to validate the information being transferred. In cryptography, a PKI is an arrangement
Public_key_infrastructure
Cryptographic algorithm for digital signatures
In cryptography, the Elliptic Curve Digital Signature Algorithm (ECDSA) offers a variant of the Digital Signature Algorithm (DSA) which uses elliptic-curve
Elliptic Curve Digital Signature Algorithm
Elliptic_Curve_Digital_Signature_Algorithm
Mechanism for authenticating cryptographic keys
In cryptography, a web of trust is a concept used in PGP, GnuPG, and other OpenPGP-compatible systems to establish the authenticity of the binding between
Web_of_trust
Variant of ID-based cryptography
Certificateless cryptography is a variant of ID-based cryptography intended to prevent the key escrow problem. Ordinarily, keys are generated by a certificate
Certificateless_cryptography
Access control by authenticated ID
Identity-based security is a type of security that focuses on access to digital information or services based on the authenticated identity of an entity
Identity-based_security
Algorithm for public key cryptography
Paillier in 1999, is a probabilistic asymmetric algorithm for public key cryptography. The problem of computing n-th residue classes is believed to be computationally
Paillier_cryptosystem
Key agreement protocol
It is a variant of the Diffie–Hellman protocol using elliptic-curve cryptography. The following example illustrates how a shared key is established. Suppose
Elliptic-curve_Diffie–Hellman
Certificate-based encryption is a system in which a certificate authority uses ID-based cryptography to produce a certificate. This system gives the users
Certificate-based_encryption
Technique in cryptography
Pairing-based cryptography is the use of a pairing between elements of two cryptographic groups to a third group with a mapping e : G 1 × G 2 → G T {\displaystyle
Pairing-based_cryptography
Multiparty cryptographic process
(2010). "Distributed Private-Key Generators for Identity-Based Cryptography". Security and Cryptography for Networks. Lecture Notes in Computer Science
Distributed_key_generation
Non-commutative cryptography is the area of cryptology where the cryptographic primitives, methods and systems are based on algebraic structures like semigroups
Non-commutative_cryptography
Hybrid encryption in cryptography
{\displaystyle m=E^{-1}(k_{E};c)} SECG, Standards for efficient cryptography, SEC 1: Elliptic Curve Cryptography, Version 2.0, May 21, 2009. Gayoso Martínez, Hernández
Integrated_Encryption_Scheme
Cryptographic key management algorithm
session keys. It combines a cryptographic so-called "ratchet" based on the Diffie–Hellman key exchange (DH) and a ratchet based on a key derivation function
Double_Ratchet_Algorithm
Method of exchanging cryptographic keys
exchange is a mathematical method of securely generating a symmetric cryptographic key over a public channel and was one of the first protocols as conceived
Diffie–Hellman_key_exchange
IEEE standardization project for public-key cryptography
public-key cryptography (IEEE Std 1363.1-2008) Password-based public-key cryptography (IEEE Std 1363.2-2008) Identity-based public-key cryptography using pairings
IEEE_P1363
Cryptographic key agreement scheme
Station-to-Station (STS) protocol is a cryptographic key agreement scheme. The protocol is based on classic Diffie–Hellman, and provides mutual key and
Station-to-Station_protocol
Cryptographic method
verifications per second. Post-quantum cryptography Lattice-based cryptography NTRU NIST Post-Quantum Cryptography Standardization Official website Thomas
Falcon_(signature_scheme)
Digital signature scheme
In cryptography, a Schnorr signature is a digital signature produced by the Schnorr signature algorithm that was invented by Claus Schnorr. It is known
Schnorr_signature
Quantum-safe key encapsulation mechanism
for the first post-quantum cryptography (PQC) standard. and was subsequently standardized as FIPS 203. The system is based on the module learning with
ML-KEM
Hyperelliptic curve cryptography is similar to elliptic curve cryptography (ECC) insofar as the Jacobian of a hyperelliptic curve is an abelian group in
Hyperelliptic curve cryptography
Hyperelliptic_curve_cryptography
Digital signature scheme
BLS digital signature, also known as Boneh–Lynn–Shacham (BLS), is a cryptographic signature scheme which allows a user to verify that a signer is authentic
BLS_digital_signature
Cryptographic protocol
attacks. Anshel–Anshel–Goldfeld key exchange Group-based cryptography Non-commutative cryptography Also referred to as the colored Burau key agreement
Algebraic_Eraser
Cryptographic system with public and private keys
are generated with algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private
Public-key_cryptography
Type of cryptosystem
A threshold cryptosystem, the basis for the field of threshold cryptography, is a cryptosystem in which the secret key is split into a number of pieces
Threshold_cryptosystem
; Cheng, Z. "Security proof of Sakai-Kasahara's identity-based encryption scheme" (PDF). Cryptography ePrint Archive. 2005/226. Groves, M. (February 2012)
Sakai–Kasahara_scheme
Scheme often used with RSA encryption
In cryptography, optimal asymmetric encryption padding (OAEP) is a padding scheme often used together with RSA encryption. OAEP was introduced by Bellare
Optimal asymmetric encryption padding
Optimal_asymmetric_encryption_padding
certificates are not to be confused with identity-based cryptography. In ID-based schemes, the subject's identity itself is used to derive their public key;
Implicit_certificate
Digital verification standard
second phase computes a single key pair for one user. Choose an approved cryptographic hash function H {\displaystyle H} with output length | H | {\displaystyle
Digital_Signature_Algorithm
Identity-based conditional proxy re-encryption (IBCPRE) is a type of proxy re-encryption (PRE) scheme in the identity-based public key cryptographic setting
Identity-based conditional proxy re-encryption
Identity-based_conditional_proxy_re-encryption
Used for encoding or decoding ciphertext
file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be different
Key_(cryptography)
SPEKE (Simple Password Exponential Key Exchange) is a cryptographic method for password-authenticated key agreement. The protocol consists of little more
SPEKE
The Boneh–Franklin scheme is an identity-based encryption system proposed by Dan Boneh and Matthew K. Franklin in 2001. This article refers to the protocol
Boneh–Franklin_scheme
Cryptosystem
encryption scheme based on the Diffie-Hellman Problem (Appendix A)" (PDF). Rubin, K.; Silverberg, A. (2003). "Torus-Based Cryptography". In Boneh, D. (ed
CEILIDH
Set of cryptographic algorithms by the NSA
replacement for NSA Suite B Cryptography algorithms. It serves as the cryptographic base to protect US National Security Systems information up to the TOP
Commercial National Security Algorithm Suite
Commercial_National_Security_Algorithm_Suite
Secure key issuing is a variant of Identity-based cryptography that reduces the level of trust that needs to be placed in a trusted third party by spreading
Secure key issuing cryptography
Secure_key_issuing_cryptography
Open-source software
with API keys or access tokens. Teleport uses identity-based cryptography to issue cryptographic identities to users, machines, workloads, devices, and
Teleport_(software)
Post-quantum digital signature scheme
{\displaystyle E_{2}} . The fundamental problem that isogeny-based cryptography like SQIsign is based on is called the isogeny path problem and can be formulated
SQIsign
Short sequence of bytes used to authenticate or look up a longer public key
In public-key cryptography, a public key fingerprint is a short sequence of bytes used to identify a longer public key. Fingerprints are created by applying
Public_key_fingerprint
Public-key encryption scheme
uncertain as of 2004 if this variant is secure. The Handbook of Applied Cryptography by Menezes, Oorschot and Vanstone considers this equivalence probable
Rabin_cryptosystem
Augmented password-authenticated key exchange protocol
Diffie–Hellman key exchange based on the client side having the user password and the server side having a cryptographic verifier derived from the password
Secure Remote Password protocol
Secure_Remote_Password_protocol
Unsolved problem in cryptography
In cryptography, the RSA problem summarizes the task of performing an RSA private-key operation given only the public key. The RSA algorithm raises a message
RSA_problem
Cryptographic protocol designed to resist quantum computer attacks
In post-quantum cryptography, NewHope is a key-agreement protocol by Erdem Alkim, Léo Ducas, Thomas Pöppelmann, and Peter Schwabe that is designed to resist
NewHope
Public-key exchange protocol
has been dropped from the National Security Agency's Suite B set of cryptographic standards. Alice has a key pair ( A , a ) {\displaystyle (A,a)} with
MQV
Cryptographic signature scheme
In cryptography, a Lamport signature or Lamport one-time signature scheme is a method for constructing a digital signature. Lamport signatures can be built
Lamport_signature
Chip encryption algorithm by Intel
remove the feature in later versions. Building on improving asymmetric cryptography of the time and group keys, Intel Labs researched and then standardized
Enhanced_privacy_ID
Asymmetric encryption algorithm developed by Robert McEliece
In cryptography, the McEliece cryptosystem is an asymmetric encryption algorithm developed in 1978 by Robert McEliece. It was the first such scheme to
McEliece_cryptosystem
Form of public key cryptography
the cryptosystem is now considered insecure. The concept of public key cryptography was introduced by Whitfield Diffie and Martin Hellman in 1976. At that
Merkle–Hellman knapsack cryptosystem
Merkle–Hellman_knapsack_cryptosystem
Digital signature scheme
In hash-based cryptography, the Merkle signature scheme is a digital signature scheme based on Merkle trees (also called hash trees) and one-time signatures
Merkle_signature_scheme
Aspect of cryptography
A cryptographic protocol is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods, often as sequences
Cryptographic_protocol
recover m {\displaystyle m} we need to take the discrete logarithm with base g p − 1 {\displaystyle g^{p-1}} . This can be done by applying L {\displaystyle
Okamoto–Uchiyama_cryptosystem
Hash function that is suitable for use in cryptography
The resistance to such search is quantified as security strength: a cryptographic hash with n {\displaystyle n} bits of hash value is expected to have
Cryptographic_hash_function
Mads Jurik: A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. Public Key Cryptography 2001: 119-136
Damgård–Jurik_cryptosystem
Digital signature scheme
"Message recovery for signature schemes based on the discrete logarithm problem". Designs, Codes and Cryptography. 7 (1–2): 61–81. doi:10.1007/BF00125076
ElGamal_signature_scheme
Key management protocol
Post-Quantum Cryptography Topics Digital signature OAEP Fingerprint PKI Web of trust Key size Identity-based cryptography Post-quantum cryptography OpenPGP
Oakley_protocol
Digital signature algorithm
In cryptography, GMR is a digital signature algorithm named after its inventors Shafi Goldwasser, Silvio Micali and Ron Rivest. As with RSA the security
GMR_(cryptography)
Asymmetric key encryption algorithm
of Applied Cryptography. CRC Press, October 1996. ISBN 0-8493-8523-7 Menezes, Oorschot, Vanstone, Scott: Handbook of Applied Cryptography (free PDF downloads)
Blum–Goldwasser_cryptosystem
Identity based encryption system
Cocks IBE scheme is an identity based encryption system proposed by Clifford Cocks in 2001. The security of the scheme is based on the hardness of the
Cocks_IBE_scheme
Cryptography framework
In cryptography, a three-pass protocol for sending messages is a framework which allows one party to securely send a message to a second party without
Three-pass_protocol
Function that derives secret keys from a secret value
In cryptography, a key derivation function (KDF) is a cryptographic algorithm that derives one or more secret keys from a secret value such as a master
Key_derivation_function
post-quantum cryptographic algorithms which are based on the difficulty of solving certain mathematical problems involving lattices. Unlike older lattice based cryptographic
Ring learning with errors key exchange
Ring_learning_with_errors_key_exchange
Cryptography, the use of codes and ciphers, began thousands of years ago. Until recent decades, it has been the story of what might be called classical
History_of_cryptography
In cryptography, the Niederreiter cryptosystem is a variation of the McEliece cryptosystem developed in 1986 by Harald Niederreiter. It applies the same
Niederreiter_cryptosystem
Dense Probabilistic Encryption (PDF). Workshop on Selected Areas of Cryptography. pp. 120–128. Fousse, Laurent; Lafourcade, Pascal; Alnuaimi, Mohamed
Benaloh_cryptosystem
Transient-key cryptography is a form of public-key cryptography wherein keypairs are generated and assigned to brief intervals of time instead of to individuals
Transient-key_cryptography
Type of cryptographic smart card
In cryptography, the OpenPGP card is an ISO/IEC 7816-4, -8 compatible smart card that is integrated with many OpenPGP functions. Using this smart card
OpenPGP_card
Asymmetric key encryption algorithm
public-key encryption scheme which is provably secure under standard cryptographic assumptions. However, it is not an efficient cryptosystem, as ciphertexts
Goldwasser–Micali cryptosystem
Goldwasser–Micali_cryptosystem
1999 public-key cryptography algorithm
algorithm was a public-key cryptography algorithm published in early 1999 by 16-year-old Irishwoman Sarah Flannery, based on an unpublished work by Michael
Cayley–Purser_algorithm
Public-key security system
Naccache, David; Stern, Jacques (1998). "A New Public Key Cryptosystem Based on Higher Residues". Proceedings of the 5th ACM Conference on Computer and
Naccache–Stern_cryptosystem
to possess and operate a quantum computer. The public-key method of cryptography allows a sender to sign a message with a signing key in such a way that
Quantum_digital_signature
European cryptographic research project
European research project funded from 2000 to 2003 to identify secure cryptographic primitives. The project was comparable to the NIST AES process and the
NESSIE
Lattice-based public key cryptosystem
encryption algorithm, is an NTRU lattice-based alternative to RSA and elliptic curve cryptography (ECC) and is based on the shortest vector problem in a lattice
NTRUEncrypt
Type of digital identity
attest to specific claims about an identity subject. These credentials can be presented and verified cryptographically, often without direct interaction
Self-sovereign_identity
Post-quantum cryptographic protocol
In cryptography, Post-Quantum Extended Diffie–Hellman (PQXDH) is a Kyber-based post-quantum key exchange method based on Diffie–Hellman key exchange. It
Post-Quantum Extended Diffie–Hellman
Post-Quantum_Extended_Diffie–Hellman
NTRU public-key cryptography digital signature algorithm
the NTRU Signature Algorithm, is an NTRU public-key cryptography digital signature algorithm based on the GGH signature scheme. The original version of
NTRUSign
Assumption used in cryptographic systems
cyclic groups. It is used as the basis to prove the security of many cryptographic protocols, most notably the ElGamal and Cramer–Shoup cryptosystems.
Decisional Diffie–Hellman assumption
Decisional_Diffie–Hellman_assumption
Key derivation function
In cryptography, PBKDF1 and PBKDF2 (Password-Based Key Derivation Function 1 and 2) are key derivation functions with a sliding computational cost, used
PBKDF2
World Wide Web Consortium cryptography standard
The Web Cryptography API is the World Wide Web Consortium’s (W3C) recommendation for a low-level interface that would increase the security of web applications
Web_Cryptography_API
Generalisation of public-key encryption
non-collusion-resistant notion of attribute-based encryption. ID-based encryption "What is Attribute-Based Encryption". Cryptography Stack Exchange. 2014. Herranz,
Attribute-based_encryption
Asymmetric key encryption algorithm
against adaptive chosen ciphertext attack using standard cryptographic assumptions. Its security is based on the computational intractability (widely assumed
Cramer–Shoup_cryptosystem
Cryptographic method
establishment) is a method in cryptography by which cryptographic keys are exchanged between two parties, allowing use of a cryptographic algorithm. If the sender
Key_exchange
Digital signature resilient to quantum cryptography
the source of digital information. Public key cryptography provides a rich set of different cryptographic algorithms the create digital signatures. However
Ring learning with errors signature
Ring_learning_with_errors_signature
Israeli–American professor
is on the area of cryptography where he has worked in numerous areas. In 1984 Adi Shamir proposed the possibility of identity-based encryption (IBE),
Dan_Boneh
Internet protocol
Identity Protocol, all occurrences of IP addresses in applications are eliminated and replaced with cryptographic host identifiers. The cryptographic
Host_Identity_Protocol
Post-quantum signature scheme
Lyubashevsky in their 2013 paper "Lattice Signature and Bimodal Gaussians". In cryptography, a digital signature ensures that a message is authentically from a specific
BLISS_signature_scheme
In cryptography, a malicious entity
In cryptography, an adversary (rarely opponent, enemy) is an entity whose aim is to prevent the users of the cryptosystem from achieving their goal (primarily
Adversary_(cryptography)
Brazilian-American cryptographer (born 1965)
works on elliptic curve cryptography and pairing-based cryptography, including the eta pairing technique, identity-based cryptographic protocols, and the family
Paulo_S._L._M._Barreto
Password algorithm Cryptographic hash function Hash collision Hash-based cryptography Cryptographic nonce Salt (cryptography) Cryptographic strength Block
List of cybersecurity information technologies
List_of_cybersecurity_information_technologies
Japanese cryptography research project
CRYPTREC is the Cryptography Research and Evaluation Committees set up by the Japanese Government to evaluate and recommend cryptographic techniques for
CRYPTREC
are designed for both key distribution and encrypted data transfer. Cryptography Computational complexity theory Okamoto–Uchiyama cryptosystem T. Okamoto
Efficient Probabilistic Public-Key Encryption Scheme
Efficient_Probabilistic_Public-Key_Encryption_Scheme
IDENTITY BASED-CRYPTOGRAPHY
IDENTITY BASED-CRYPTOGRAPHY
Boy/Male
Muslim/Islamic
Smiling
Girl/Female
Indian
Identity
Boy/Male
Muslim/Islamic
Brave
Boy/Male
Indian, Sanskrit
Tendency to Identify Oneself with External Phenomena
Girl/Female
British, English
Based
Boy/Male
Tamil
Base
Boy/Male
Arabic, Australian
Smiling
Male
Egyptian
, the father of Hor-imhotep.
Girl/Female
Muslim
Identity
Boy/Male
Muslim
Identity
Boy/Male
English
Phonetic name based on initials.
Boy/Male
Muslim
Smiling
Boy/Male
Afghan, African, Arabic, Australian, Chinese, Greek, Indian, Muslim
Brave
Boy/Male
Arabic, Muslim
One who can Identify Between Truth and Falsehood
Boy/Male
Indian
Base
Boy/Male
Arabic, French, Hindu, Indian, Marathi, Muslim, Sindhi
Joy; Solved; Based
Boy/Male
Arabic, Gujarati, Hindu, Indian, Kannada, Muslim
Identity
Girl/Female
Arabic
Entity; Strong Existence
Girl/Female
Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Oriya, Punjabi, Sikh, Sindhi, Tamil, Telugu
Glories; Love; Identity; Pride
Girl/Female
African, American, Arabic, Australian, Gujarati, Indian, Jain, Japanese, Muslim, Sanskrit, Swahili, Tamil
Name; One's Self; The Victorious; Named Child; Identity
IDENTITY BASED-CRYPTOGRAPHY
IDENTITY BASED-CRYPTOGRAPHY
Girl/Female
Arabic, Muslim
The Rainy Cloud; Downpour
Boy/Male
Teutonic
Rich.
Girl/Female
Indian, Tamil
Peace
Male
Italian
Italian form of German Berthold, BERTOLDO means "bright ruler."
Boy/Male
Indian
Brust
Boy/Male
Hindu
One with few desires
Boy/Male
Hindu
Crown, King, A form of keon
Girl/Female
African, Australian, Swahili
Prayer
Girl/Female
Biblical
The Lord's secret or miracle.
Girl/Female
Arabic, Indian
Smooth; Soft
IDENTITY BASED-CRYPTOGRAPHY
IDENTITY BASED-CRYPTOGRAPHY
IDENTITY BASED-CRYPTOGRAPHY
IDENTITY BASED-CRYPTOGRAPHY
IDENTITY BASED-CRYPTOGRAPHY
n.
A rustic play; -- called also prisoner's base, prison base, or bars.
n.
Wearing, or protected by, bases.
p. pr. & vb. n.
of Identify
a.
Having a base, or having as a base; supported; as, broad-based.
pl.
of Identity
n.
An identity or union of substance.
a.
Reduced; lowered; restrained; as, to speak with bated breath.
a.
Alloyed with inferior metal; debased; as, base coin; base bullion.
n.
The doctrine taught by Schelling, that matter and mind, and subject and object, are identical in the Absolute; -- called also the system / doctrine of identity.
v. t.
To establish the identity of; to prove to be the same with something described, claimed, or asserted; as, to identify stolen property.
imp. & p. p.
of Identify
n.
Same as Prison base.
a.
Deep or grave in sound; as, the base tone of a violin.
n.
A pie; baked food.
a.
Morally low. Hence: Low-minded; unworthy; without dignity of sentiment; ignoble; mean; illiberal; menial; as, a base fellow; base motives; base occupations.
a.
Not held by honorable service; as, a base estate, one held by services not honorable; held by villenage. Such a tenure is called base, or low, and the tenant, a base tenant.
n.
An identical equation.
n.
The condition of being the same with something described or asserted, or of possessing a character claimed; as, to establish the identity of stolen goods.
n.
The state or quality of being identical, or the same; sameness.
imp. & p. p.
of Base