Black-box anonymous commit-and-prove

DOI10.1007/978-3-031-14791-3_26zbMATH Open1518.94090OpenAlexW4294698848MaRDI QIDQ6134847FDOQ6134847

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

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

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

• How to share a secret
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mercurial Commitments with Applications to Zero-Knowledge Sets
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Round-optimal black-box commit-and-prove with succinct communication
• Round-Optimal Black-Box Two-Party Computation
• Probabilistically Checkable Proofs of Proximity with Zero-Knowledge

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)