Non-repudiation without public-key

DOI10.1007/BFB0023284zbMATH Open1541.94062MaRDI QIDQ6570944FDOQ6570944

Authors: R. Taylor 

Publication date: 11 July 2024

Recommendations

• A signature scheme with non-repudiation
• A practical and insider secure signcryption with non-interactive non-repudiation
• Signcryption with non-interactive non-repudiation
• scientific article; zbMATH DE number 1088919
• Improved public key authentication scheme for non-repudiation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• New hash functions and their use in authentication and set equality
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Message authentication with arbitration of transmitter/receiver disputes
• A note on the complexity of cryptography (Corresp.)
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• Title not available (Why is that?)
• Cryptocomplexity and NP-completeness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Non-repudiation without public-key

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570944)