Signatures and Efficient Proofs on Committed Graphs and NP-Statements

DOI10.1007/978-3-662-47854-7_18zbMath1415.94434OpenAlexW2233192164MaRDI QIDQ2948189

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

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

Related Items (1)

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

Cites Work

• Efficient signature generation by smart cards
• How to construct constant-round zero-knowledge proof systems for NP
• Structure-Preserving Signatures and Commitments to Group Elements
• Efficient Protocols for Set Membership and Range Proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A method for obtaining digital signatures and public-key cryptosystems
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Signatures and Efficient Proofs on Committed Graphs and NP-Statements