Non-repudiation without public-key

DOI10.1007/BFB0023284zbMATH Open1541.94062MaRDI QIDQ6570944

R. Taylor

Publication date: 11 July 2024

Mathematics Subject Classification ID

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

Cites Work

• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• New hash functions and their use in authentication and set equality
• Cryptocomplexity and NP-completeness
• A note on the complexity of cryptography (Corresp.)
• Message Authentication with Arbitration of Transmitter/Receiver Disputes
• 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?)
• 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)