Information about Gmr (cryptography)
In cryptography, GMR is a digital signature algorithm named after its inventors Shafi Goldwasser, Silvio Micali and Ron Rivest.
As with RSA the security of the system is related to the difficulty of factoring very large numbers. But, in contrast to RSA, GMR is secure against adaptive chosen-message attacks — even when an attacker receives signatures for messages of his choice, this does not allow him to forge a signature for a single additional message.
..... Click the link for more information.
As with RSA the security of the system is related to the difficulty of factoring very large numbers. But, in contrast to RSA, GMR is secure against adaptive chosen-message attacks — even when an attacker receives signatures for messages of his choice, this does not allow him to forge a signature for a single additional message.
External links
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks - Shafti Goldwasser, Silvio Micali, Ronald L. Rivest
| Algorithms: Cramer-Shoup | DH | DSA | ECDH | ECDSA | EKE | ElGamal | GMR | IES | Lamport | MQV | NTRUEncrypt | NTRUSign | Paillier | Rabin | RSA | Schnorr | SPEKE | SRP | XTR |
| Theory: Discrete logarithm | Elliptic curve cryptography | RSA problem |
| Standardization: ANS X9F1 | CRYPTREC | IEEE P1363 | NESSIE | NSA Suite B Misc: Digital signature | Fingerprint | PKI | Web of trust | Key size |
| History of cryptography | Cryptanalysis | | Topics in cryptography |
| Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers |
Cryptography (or cryptology; derived from Greek κρυπτός kryptós "hidden," and the verb γράφω gráfo "write" or λεγειν legein
..... Click the link for more information.
..... Click the link for more information.
digital signature or digital signature scheme is a type of asymmetric cryptography used to simulate the security properties of a signature in digital, rather than written, form.
..... Click the link for more information.
..... Click the link for more information.
In mathematics, computing, linguistics, and related disciplines, an algorithm is a finite list of well-defined instructions for accomplishing some task that, given an initial state, will proceed through a well-defined series of successive states, eventually terminating in an
..... Click the link for more information.
..... Click the link for more information.
Shafrira Goldwasser
Shafrira Goldwasser
Born 1958
Field Computer Science, Cryptography
Institutions Massachusetts Institute of Technology,
Weizmann Institute of Science
..... Click the link for more information.
Shafrira Goldwasser
Born 1958
Field Computer Science, Cryptography
Institutions Massachusetts Institute of Technology,
Weizmann Institute of Science
..... Click the link for more information.
Silvio Micali (born October 13 1954) is an Italian-born computer scientist at MIT Computer Science and Artificial Intelligence Laboratory and a professor of computer science in MIT's Department of Electrical Engineering and Computer Science since 1983.
..... Click the link for more information.
..... Click the link for more information.
..... Click the link for more information.
RSA is an algorithm for public-key cryptography. It was the first algorithm known to be suitable for signing as well as encryption, and one of the first great advances in public key cryptography.
..... Click the link for more information.
..... Click the link for more information.
integer factorization is the process of breaking down a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer.
..... Click the link for more information.
..... Click the link for more information.
A chosen-plaintext attack (CPA) is an attack model for cryptanalysis which presumes that the attacker has the capability to choose arbitrary plaintexts to be encrypted and obtain the corresponding ciphertexts.
..... Click the link for more information.
..... Click the link for more information.
Public-key cryptography, also known as asymmetric cryptography, is a form of cryptography in which a user has a pair of cryptographic keys - a public key and a private key. The private key is kept secret, while the public key may be widely distributed.
..... Click the link for more information.
..... Click the link for more information.
The Cramer-Shoup system is an asymmetric key encryption algorithm, and was the first efficient scheme proven to be secure against adaptive chosen ciphertext attack using standard cryptographic assumptions.
..... Click the link for more information.
..... Click the link for more information.
Diffie-Hellman (D-H) key exchange is a cryptographic protocol that allows two parties that have no prior knowledge of each other to jointly establish a shared secret key over an insecure communications channel.
..... Click the link for more information.
..... Click the link for more information.
The Digital Signature Algorithm (DSA) is a United States Federal Government standard or FIPS for digital signatures. It was proposed by the National Institute of Standards and Technology (NIST) in August 1991 for use in their Digital Signature Standard (DSS)
..... Click the link for more information.
..... Click the link for more information.
Elliptic Curve Diffie-Hellman (ECDH) is a key agreement protocol that allows two parties to estabilish a shared secret key over an insecure channel[1] [2]. This key can then be used to encrypt subsequent communications using a symmetric key cipher.
..... Click the link for more information.
..... Click the link for more information.
Elliptic Curve DSA (ECDSA) is a variant of the Digital Signature Algorithm (DSA) which operates on elliptic curve groups. As with Elliptic Curve Cryptography in general, the bit size of the public key believed to be needed for ECDSA is about twice the size of the security level, in
..... Click the link for more information.
..... Click the link for more information.
Encrypted Key Exchange (also known as EKE) is a family of password-authenticated key agreement methods described by Steven M. Bellovin and Michael Merritt [1].
..... Click the link for more information.
..... Click the link for more information.
In cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography which is based on the Diffie-Hellman key agreement. It was described by Taher Elgamal in 1984[1].
..... Click the link for more information.
..... Click the link for more information.
Integrated Encryption Scheme (IES) is a public-key encryption scheme which provides semantic security against an adversary who is allowed to use chosen-plaintext and chosen-ciphertext attacks. The scheme is based on Diffie-Hellman problem.
..... Click the link for more information.
..... Click the link for more information.
In cryptography, a Lamport signature or Lamport one-time signature scheme is a method for constructing a digital signature. Lamport signatures can be built from any cryptographically secure one-way function; usually a cryptographic hash function is used.
..... Click the link for more information.
..... Click the link for more information.
MQV (Menezes-Qu-Vanstone) is an authenticated protocol for key agreement based on the Diffie-Hellman scheme. Like other authenticated Diffie-Hellman schemes, MQV provides protection against an active attacker.
..... Click the link for more information.
..... Click the link for more information.
NTRUEncrypt, also known as the NTRU encryption algorithm, is an asymmetric key encryption algorithm for public key cryptography. It was invented in the mid-1990s and is patented and endorsed by NTRU Cryptosystems, Inc..
..... Click the link for more information.
..... Click the link for more information.
NTRUSign, also known as the NTRU Signature Algorithm, is a public key cryptography digital signature algorithm based on the GGH signature scheme. It was first presented at the rump session of Asiacrypt 2001 and published in peer-reviewed form at the RSA Conference 2003.
..... Click the link for more information.
..... Click the link for more information.
The Paillier cryptosystem is a probabilistic asymmetric algorithm for public key cryptography, invented by Pascal Paillier in 1999. The problem of computing n-th residue classes is believed to be computationally difficult.
..... Click the link for more information.
..... Click the link for more information.
The Rabin cryptosystem is an asymmetric cryptographic technique, whose security, like that of RSA, is related to the difficulty of factorization. However the Rabin cryptosystem has the advantage that the problem on which it relies has been proved to be as hard as integer
..... Click the link for more information.
..... Click the link for more information.
RSA is an algorithm for public-key cryptography. It was the first algorithm known to be suitable for signing as well as encryption, and one of the first great advances in public key cryptography.
..... Click the link for more information.
..... Click the link for more information.
In cryptography, a Schnorr signature is a digital signature produced by the Schnorr signature algorithm. Its security is based on the intractibility of certain discrete logarithm problems.
..... Click the link for more information.
..... Click the link for more information.
SPEKE (Simple Password Exponential Key Exchange) is a cryptographic method for password-authenticated key agreement.
..... Click the link for more information.
Description
The protocol consists of little more than a Diffie-Hellman key exchange where the Diffie-Hellman generator g..... Click the link for more information.
The Secure Remote Password Protocol (SRP) is a password-authenticated key agreement protocol.
..... Click the link for more information.
Overview
The SRP protocol has a number of desirable properties: it allows a user to authenticate himself to a server, it is resistant to dictionary attacks mounted by an..... Click the link for more information.
In cryptography, XTR is an algorithm for public-key encryption. XTR stands for ‘ECSTR’, which is an abbreviation for Efficient and Compact Subgroup Trace Representation.
..... Click the link for more information.
..... Click the link for more information.
In mathematics, specifically in abstract algebra and its applications, discrete logarithms are group-theoretic analogues of ordinary logarithms. The problem of computing discrete logarithms is a sort of sibling to the problem of integer factorization, in that both problems are
..... Click the link for more information.
..... Click the link for more information.
This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus
