Unconditionally Secure Signature Schemes Revisited

DOI10.1007/978-3-642-20728-0_10MaRDI QIDQ3002106zbMATH OpenOpenAlexFDO

Authors Colleen M. Swanson, D. R. Stinson

Publication date 19 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20728-0_10

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Unconditionally secure signature schemes revisited
• scientific article; zbMATH DE number 2086723
• Construction methodology of unconditionally secure signature schemes
• Relations Among Security Notions for Undeniable Signature Schemes
• scientific article; zbMATH DE number 220694
• scientific article; zbMATH DE number 708796
• Efficient unconditionally secure signatures using universal hashing
• Unconditionally secure blind signatures
• An efficient existentially unforgeable signature scheme and its applications
• scientific article; zbMATH DE number 1406783

Cited in

(14)

• Efficient unconditionally secure signatures using universal hashing
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Efficient constant-round MPC with identifiable abort and public verifiability
• Theoretically extensible quantum digital signature with starlike cluster states
• The postprocessing of quantum digital signatures
• An existential unforgeable signature scheme based on multivariate quadratic equations
• Quantum digital signature based on measurement-device-independent continuous-variable scheme
• Unconditionally secure signature schemes revisited
• scientific article; zbMATH DE number 1583775 (Why is no real title available?)
• Efficient secure multiparty computation with identifiable abort
• scientific article; zbMATH DE number 5631814 (Why is no real title available?)
• Construction methodology of unconditionally secure signature schemes
• scientific article; zbMATH DE number 2086723 (Why is no real title available?)
• Must the communication graph of MPC protocols be an expander?

This page was built for publication: Unconditionally Secure Signature Schemes Revisited

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