Short discreet proofs

DOI10.1007/3-540-68339-9_12MaRDI QIDQ2876893zbMATH OpenOpenAlexWikidataFDO

Authors René Peralta, Joan Boyar

Publication date 20 August 2014

Published in Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68339-9_12

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Short non-interactive cryptographic proofs
• scientific article; zbMATH DE number 4053065
• Noninteractive Zero-Knowledge
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• Short non-interactive zero-knowledge proofs

Cited in

(5)

• Minimum disclosure proofs of knowledge
• Short non-interactive cryptographic proofs
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• Secure sealed-bid online auctions using discreet cryptographic proofs
• Logic Programming

This page was built for publication: Short discreet proofs

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