Efficient threshold zero-knowledge with applications to user-centric protocols

DOI10.1007/978-3-642-32284-6_9MaRDI QIDQ5200460zbMATH OpenOpenAlexFDO

Authors Marcel Keller, Gert Læssøe Mikkelsen, Andy Rupp

Publication date 6 November 2012

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-32284-6_9

zbMATH Keywords

multiparty computationanonymous credentialsthreshold cryptographye-cash\(\Sigma \)-protocolsdistributed provers

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
• Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
• Efficient Protocols for Set Membership and Range Proofs
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• Zero-knowledge proofs of identity

Cited in

(2)

• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Distributed user identification by zero-knowledge access rights proving

This page was built for publication: Efficient threshold zero-knowledge with applications to user-centric protocols

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