|
Identity-based 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 public key of a user is some unique information about the identity of the user (e.g. a user's email address). This means that a sender who has access to the public parameters of the system can encrypt a message using e.g. the text-value of the receiver's name or email address as a key. The receiver obtains its decryption key from a central authority, which needs to be trusted as it generates secret keys for every user. Identity-based encryption was proposed by Adi Shamir in 1984. He was however only able to give an instantiation of Identity-based cryptography, identity-based signatures. Identity-based encryption remained an open problem for many years. The pairing-based cryptography, pairing-based Boneh–Franklin scheme and Cocks IBE scheme, Cocks's encryption scheme based on quadratic residues both solved the IBE problem in 2001. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 a public key. The public string could include an email address, domain name, or a physical IP address. The first implementation of identity-based signatures and an email-address based public-key infrastructure (PKI) was developed by Adi Shamir in 1984, which allowed users to verify digital signatures using only public information such as the user's identifier. Under Shamir's scheme, a trusted third party would deliver the private key to the user after verification of the user's identity, with verification essentially the same as that required for issuing a public-key certificate, certificate in a typical PKI. Shamir similarly proposed identity-based encryption, which appeared particularly attractive since there was no need to acquire an identity's public key prior to encryption. However, he was unable to come up with a concrete solut ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matthew K
Matthew may refer to: * Matthew (given name) * Matthew (surname) * ''Matthew'' (album), a 2000 album by rapper Kool Keith * Matthew (elm cultivar), a cultivar of the Chinese Elm ''Ulmus parvifolia'' Christianity * Matthew the Apostle, one of the apostles of Jesus * Gospel of Matthew, a book of the Bible Ships * ''Matthew'' (1497 ship), the ship sailed by John Cabot in 1497, with two 1990s replicas * MV ''Matthew I'', a suspected drug-runner scuttled in 2013 * Interdiction of MV ''Matthew'', a 2023 operation of the Irish military against a 2001 Panamanian cargo ship See also * Matt (given name), the diminutive form of Matthew * Mathew, alternative spelling of Matthew * Matthews (other) * Matthew effect The Matthew effect, sometimes called the Matthew principle or cumulative advantage, is the tendency of individuals to accrue social or economic success in proportion to their initial level of popularity, friends, and wealth. It is sometimes summar ... * Tropic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ciphertext Expansion
In cryptography, the term ciphertext expansion refers to the length increase of a message when it is encrypted. Many modern cryptosystems cause some degree of expansion during the encryption process, for instance when the resulting ciphertext must include a message-unique Initialization Vector (IV). Probabilistic encryption schemes cause ciphertext expansion, as the set of possible ciphertexts is necessarily greater than the set of input plaintexts. Certain schemes, such as Cocks Identity Based Encryption, or the Goldwasser-Micali cryptosystem result in ciphertexts hundreds or thousands of times longer than the plaintext. Ciphertext expansion may be offset or increased by other processes which compress or expand the message, e.g., data compression or error correction coding. Reasons why Ciphertext expansion can occur Probabilistic Encryption Probabilistic encryption schemes, such as the Goldwasser-Micali cryptosystem, necessarily produce ciphertexts that are longer tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadratic Residuosity Problem
The quadratic residuosity problem (QRP) in computational number theory is to decide, given integers a and N, whether a is a quadratic residue modulo N or not. Here N = p_1 p_2 for two unknown primes p_1 and p_2, and a is among the numbers which are not obviously quadratic non-residues (see below). The problem was first described by Gauss in his '' Disquisitiones Arithmeticae'' in 1801. This problem is believed to be computationally difficult. Several cryptographic methods rely on its hardness, see . An efficient algorithm for the quadratic residuosity problem immediately implies efficient algorithms for other number theoretic problems, such as deciding whether a composite N of unknown factorization is the product of 2 or 3 primes. Precise formulation Given integers a and T, a is said to be a ''quadratic residue modulo T'' if there exists an integer b such that :a \equiv b^2 \pmod T. Otherwise we say it is a quadratic non-residue. When T = p is a prime, it is customary t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Clifford Cocks
Clifford Christopher Cocks (born 28 December 1950) is a British mathematician and cryptographer. In the early 1970s, while working at the United Kingdom Government Communications Headquarters (GCHQ), he developed an early public-key cryptography (PKC) system. This pre-dated commercial offerings, but due to the classified nature of Cocks' work, it did not become widely known until 1997 when the work was declassified. As his work was not available for public review until 1997, it had no impact on numerous commercial initiatives relating to Internet security that had been commercially developed and that were well established by 1997. His work was technically aligned with the Diffie–Hellman key exchange and elements of the RSA algorithm; these systems were independently developed and commercialized. Education Cocks was educated at Manchester Grammar School and went on to study the Mathematical Tripos as an undergraduate at King's College, Cambridge. He continued as a PhD stude ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Provable Security
Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields. Usually, this refers to mathematical proofs, which are common in cryptography. In such a proof, the capabilities of the attacker are defined by an adversarial model (also referred to as attacker model): the aim of the proof is to show that the attacker must solve the underlying hard problem in order to break the security of the modelled system. Such a proof generally does not consider side-channel attacks or other implementation-specific attacks, because they are usually impossible to model without implementing the system (and thus, the proof only applies to this implementation). Outside of cryptography, the term is often used in conjunction with secure coding and security by design, both of which can rely on proofs to show the security of a particular approach. As with the cryptographic setting, this involves an attacker model and a model o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ElGamal Encryption
In cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography which is based on the Diffie–Hellman key exchange. It was described by Taher Elgamal in 1985. ElGamal encryption is used in the free GNU Privacy Guard software, recent versions of PGP, and other cryptosystems. The Digital Signature Algorithm (DSA) is a variant of the ElGamal signature scheme, which should not be confused with ElGamal encryption. ElGamal encryption can be defined over any cyclic group G, like multiplicative group of integers modulo ''n'' if and only if ''n'' is 1, 2, 4, ''p''''k'' or 2''p''''k'', where ''p'' is an odd prime and . Its security depends upon the difficulty of the Decisional Diffie Hellman Problem in G. The algorithm The algorithm can be described as first performing a Diffie–Hellman key exchange to establish a shared secret s, then using this as a one-time pad for encrypting the message. ElGamal encryption is performed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probabilistic Encryption
Probabilistic encryption is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. The term "probabilistic encryption" is typically used in reference to public key encryption algorithms; however various symmetric key encryption algorithms achieve a similar property (e.g., block ciphers when used in a chaining mode such as CBC), and stream ciphers such as Freestyle which are inherently random. To be semantically secure, that is, to hide even partial information about the plaintext, an encryption algorithm must be probabilistic. History The first provably-secure probabilistic public-key encryption scheme was proposed by Shafi Goldwasser and Silvio Micali, based on the hardness of the quadratic residuosity problem and had a message expansion factor equal to the public key size. More efficient probabilistic encryption algorithms include Elgamal, Paillier, and various constructi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tate Pairing
In mathematics, Tate pairing is any of several closely related bilinear pairings involving elliptic curves or abelian varieties, usually over local or finite fields, based on the Tate duality pairings introduced by and extended by . applied the Tate pairing over finite fields to cryptography. See also * Weil pairing In mathematics, the Weil pairing is a pairing (bilinear form, though with multiplicative notation) on the points of order dividing ''n'' of an elliptic curve ''E'', taking values in ''n''th roots of unity. More generally there is a similar Weil ... References * * * * Pairing-based cryptography Elliptic curve cryptography Elliptic curves {{Crypto-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weil Pairing
In mathematics, the Weil pairing is a pairing (bilinear form, though with multiplicative notation) on the points of order dividing ''n'' of an elliptic curve ''E'', taking values in ''n''th roots of unity. More generally there is a similar Weil pairing between points of order ''n'' of an abelian variety and its dual. It was introduced by André Weil (1940) for Jacobians of curves, who gave an abstract algebraic definition; the corresponding results for elliptic functions were known, and can be expressed simply by use of the Weierstrass sigma function. Formulation Choose an elliptic curve ''E'' defined over a field ''K'', and an integer ''n'' > 0 (we require ''n'' to be coprime to char(''K'') if char(''K'') > 0) such that ''K'' contains a primitive nth root of unity. Then the ''n''-torsion on E(\overline) is known to be a Cartesian product of two cyclic groups of order ''n''. The Weil pairing produces an ''n''-th root of unity :w(P,Q) \in \mu_n by mea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elliptic Curves
In mathematics, an elliptic curve is a Smoothness, smooth, Projective variety, projective, algebraic curve of Genus of an algebraic curve, genus one, on which there is a specified point . An elliptic curve is defined over a field (mathematics), field and describes points in , the Cartesian product of with itself. If the field's characteristic (algebra), characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions for: :y^2 = x^3 + ax + b for some coefficients and in . The curve is required to be Singular point of a curve, non-singular, which means that the curve has no cusp (singularity), cusps or Self-intersection, self-intersections. (This is equivalent to the condition , that is, being square-free polynomial, square-free in .) It is always understood that the curve is really sitting in the projective plane, with the point being the unique point at infinity. Many sources define an elliptic curve to be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
