Non-repudiation without public-key

DOI10.1007/BFB0023284zbMATHMaRDI QIDQ6570944FDO

Authors R. Taylor

Publication date 11 July 2024

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4191829 (Why is no real title available?)
• scientific article; zbMATH DE number 4106765 (Why is no real title available?)
• scientific article; zbMATH DE number 176541 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 503250 (Why is no real title available?)
• scientific article; zbMATH DE number 1024067 (Why is no real title available?)
• scientific article; zbMATH DE number 1024068 (Why is no real title available?)
• scientific article; zbMATH DE number 1088919 (Why is no real title available?)
• scientific article; zbMATH DE number 1088942 (Why is no real title available?)
• scientific article; zbMATH DE number 1406776 (Why is no real title available?)
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• A note on the complexity of cryptography (Corresp.)
• Cryptocomplexity and NP-completeness
• Message authentication with arbitration of transmitter/receiver disputes
• New hash functions and their use in authentication and set equality

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)