Signatures and efficient proofs on committed graphs and NP-statements

DOI10.1007/978-3-662-47854-7_18MaRDI QIDQ2948189zbMATH OpenOpenAlexFDO

Authors Thomas Groß

Publication date 29 September 2015

Published in Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL https://eprint.ncl.ac.uk/fulltext.aspx?url=223551/B30BB7E0-5E72-45FD-8F95-8A3CC3184630.pdf&pub_id=223551

Mathematics Subject Classification ID

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

Recommendations

• A signature scheme with efficient proof of validity
• scientific article; zbMATH DE number 2079931
• scientific article; zbMATH DE number 1952906
• On Signatures of Knowledge
• Publication:4945385

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Efficient proofs that a committed number lies in an interval
• Efficient Protocols for Set Membership and Range Proofs
• Efficient signature generation by smart cards
• How to construct constant-round zero-knowledge proof systems for NP
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1303150 (Why is no real title available?)
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 1088250 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• scientific article; zbMATH DE number 2079931 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• Structure-preserving signatures and commitments to group elements
• The complexity of theorem-proving procedures

Cited in

(1)

• MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system

This page was built for publication: Signatures and efficient proofs on committed graphs and NP-statements

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