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.

External links

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks - Shafi Goldwasser, Silvio Micali, Ronald L. Rivest

Public-key cryptography

Algorithms	Benaloh Blum–Goldwasser Cayley–Purser CEILIDH Cramer–Shoup Damgård–Jurik DH DSA EPOC ECDH ECDSA EdDSA EKE ElGamal signature scheme GMR Goldwasser–Micali HFE IES Lamport McEliece Merkle–Hellman MQV Naccache–Stern Naccache–Stern knapsack cryptosystem NTRUEncrypt NTRUSign Paillier Rabin RSA Okamoto–Uchiyama Schnorr Schmidt–Samoa SPEKE SRP STS Three-pass protocol XTR

Theory	Discrete logarithm Elliptic curve cryptography Non-commutative cryptography RSA problem

Standardization	CRYPTREC IEEE P1363 NESSIE NSA Suite B

Topics	Digital signature OAEP Fingerprint PKI Web of trust Key size

Cryptography

History of cryptography Cryptanalysis Cryptography portal Outline of cryptography

Symmetric-key algorithm Block cipher Stream cipher Public-key cryptography Cryptographic hash function Message authentication code Random numbers Steganography