Distributed Provers with Applications to Undeniable Signatures

DOI10.1007/3-540-46416-6_20zbMATH Open0791.68051OpenAlexW2129462878MaRDI QIDQ4037468FDOQ4037468

Authors: Torben P. Pedersen 

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_20

Recommendations

• Practical (fully) distributed signatures provably secure in the standard model
• The power of distributed verifiers in interactive proofs
• Cryptography and Coding
• Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
• Practical distributed signatures in the standard model
• Progress in Cryptology - INDOCRYPT 2004
• Verifiable secret sharing for general access structures, with application to fully distributed proxy signatures
• Trade-offs in distributed interactive proofs

zbMATH Keywords

proof systemundeniable signaturesdistributed prover protocols

Mathematics Subject Classification ID

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

Cited In (20)

• Witness-indistinguishable arguments with \(\varSigma\)-protocols for bundled witness spaces and its application to global identities
• Efficient nonrepudiable threshold proxy signature scheme with known signers against the collusion attack
• A general, flexible and efficient proof of inclusion and exclusion
• An ECDLP-Based Threshold Proxy Signature Scheme Using Self-Certified Public Key System
• Threshold undeniable signature scheme based on conic
• Redundancy in distributed proofs
• A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
• How to delegate computations
• Electronic jury voting protocols
• Robust threshold DSS signatures
• Improvement of threshold proxy signature scheme
• Factoring based proxy signature schemes
• Cryptography and Coding
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• Proving without knowing: on oblivious, agnostic and blindfolded provers
• On the statistical properties of Diffie-Hellman distributions
• Fair hierarchical secret sharing scheme based on smart contract
• Robust and efficient sharing of RSA functions
• Ownership proofs of digital works based on secure multiparty computation
• Efficient VSS free of computational assumption

This page was built for publication: Distributed Provers with Applications to Undeniable Signatures

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