Non-repudiation without public-key
type: Item
instance of: scholarly article
title: Non-repudiation without public-key
zbMATH Open document ID: 1541.94062
author: R. Taylor
publication date: 2024-07-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7879792
MaRDI profile type: Publication
cites work: Q3211422
cites work: Q4341758
cites work: A note on the complexity of cryptography (Corresp.)
cites work: Q4279573
cites work: Cryptocomplexity and NP-completeness
cites work: Q4198056
cites work: Q4365767
cites work: Q4341759
cites work: Q4940692
cites work: Q3830942
cites work: Message Authentication with Arbitration of Transmitter/Receiver Disputes
cites work: A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
cites work: Q4035708
cites work: Q4365744
cites work: New hash functions and their use in authentication and set equality
DOI: 10.1007/BFB0023284
description: scientific article; zbMATH DE number 7879792