Sammenlign metoder

	Ring-signatur	HMAC	RSA-kryptosystemet
Fagfelt	Kryptografi	Kryptografi	Kryptografi
Familie	Machine learning	Machine learning	Machine learning
Opprinnelsesår	2001	1997	1978
Opphavsperson	Ronald Rivest	Hugo Krawczyk	Ronald Rivest
Type	signature scheme with anonymity	cryptographic authentication mechanism	asymmetric encryption algorithm
Opprinnelig kilde	Rivest, R. L., Shamir, A., & Tauman, Y. (2001). How to leak a secret. In Advances in Cryptology - ASIACRYPT 2001, LNCS 2248, pp. 552-565.	Krawczyk, H., Bellare, M., & Crechanko, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104.	Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
Alias	ring signature, group signature	HMAC, keyed hash function	RSA encryption, RSA public-key cryptography
Relaterte	3	3	4
Sammendrag	A ring signature is a digital signature scheme allowing a member of a group (ring) to sign a message on behalf of the group without revealing the signer's identity. Proposed by Rivest, Shamir, and Tauman in 2001, ring signatures provide signer anonymity while still proving that the signature comes from one member of a specified set. This cryptographic primitive is widely used in privacy-preserving applications, whistleblowing systems, and anonymous messaging platforms.	HMAC (Hash-Based Message Authentication Code) is a cryptographic algorithm for authenticating messages using a secret key and a hash function. Standardized in RFC 2104 (1997), HMAC can be combined with any cryptographic hash function (SHA-256, SHA-3, etc.) to create a message authentication code (MAC). HMAC provides both data integrity and authentication, detecting both accidental corruption and deliberate tampering, and is widely used in web security (TLS/SSL), API authentication, and network protocols.	RSA is a foundational public-key cryptosystem developed by Rivest, Shamir, and Adleman in 1978. It enables secure encryption and digital signatures by using a pair of mathematically linked keys: a public key for encryption and a private key for decryption. RSA's security relies on the computational difficulty of factoring large composite numbers into their prime factors.