Interactive Bi-Proof Systems and Undeniable Signature Schemes

DOI10.1007/3-540-46416-6_21MaRDI QIDQ4037469zbMATH OpenOpenAlexFDO

Authors Atsushi Fujioka, Tatsuaki Okamoto, Kazuo Ohta

Publication date 18 May 1993

Published in Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_21

zbMATH Keywords

cryptographydigital signaturesprotocolproof systemundeniable signature schemescommon witness probleminformation security systemsminimum knowledge interactive bi-proof system

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Cryptography and Coding
• Identity-based undeniable signatures from bilinear pairings
• scientific article; zbMATH DE number 1031000
• Interactive Proofs with Provable Security against Honest Verifiers
• Provably secure convertible undeniable signatures with unambiguity
• Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
• scientific article; zbMATH DE number 220694
• scientific article; zbMATH DE number 708796
• scientific article; zbMATH DE number 708798
• Convertible and selectively convertible undeniable signature schemes

Cited in

(5)

• Identity based designated multi-confirmer signature: a new type signature
• Identity based group-oriented undeniable signature scheme
• A Generic Construction for Universally-Convertible Undeniable Signatures
• Threshold undeniable signature scheme based on conic
• Proving without knowing: on oblivious, agnostic and blindfolded provers

This page was built for publication: Interactive Bi-Proof Systems and Undeniable Signature Schemes

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