Black-box anonymous commit-and-prove

DOI10.1007/978-3-031-14791-3_26zbMath1518.94090OpenAlexW4294698848MaRDI QIDQ6134847

Alessandra Scafuro

Publication date: 25 July 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-14791-3_26

zbMATH Keywords

black-box commit-and-prove protocol in the anonymous setting

Mathematics Subject Classification ID

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

Cites Work

• Round-optimal black-box commit-and-prove with succinct communication
• How to share a secret
• Round-Optimal Black-Box Two-Party Computation
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Mercurial Commitments with Applications to Zero-Knowledge Sets
• Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Black-box anonymous commit-and-prove