Black-box anonymous commit-and-prove

DOI10.1007/978-3-031-14791-3_26MaRDI QIDQ6134847zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Black-box non-interactive non-malleable commitments
• Round-optimal black-box commit-and-prove with succinct communication
• Bounds on the efficiency of black-box commitment schemes
• Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
• Black-box constructions of protocols for secure computation
• scientific article; zbMATH DE number 1980960
• Black-box non-black-box zero knowledge
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1942413 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• How to share a secret
• Mercurial Commitments with Applications to Zero-Knowledge Sets
• Probabilistically checkable proofs of proximity with zero-knowledge
• Round-optimal black-box commit-and-prove with succinct communication
• Round-optimal black-box two-party computation

Cited in

(2)

• Anonymous tokens with private metadata bit
• Round-optimal black-box commit-and-prove with succinct communication

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

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