Short non-interactive cryptographic proofs

DOI10.1007/S001450010011zbMath0966.68069DBLPjournals/joc/BoyarDP00OpenAlexW2037038890WikidataQ62472233 ScholiaQ62472233MaRDI QIDQ1590362

René Peralta, Ivan B. Damgård, Joan. Boyar

Publication date: 21 December 2000

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001450010011

zbMATH Keywords

cryptographic proofs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (6)

On various nonlinearity measures for Boolean functions ⋮ Upper bounds on the multiplicative complexity of symmetric Boolean functions ⋮ Tight bounds for the multiplicative complexity of symmetric functions ⋮ Secure sealed-bid online auctions using discreet cryptographic proofs ⋮ The multiplicative complexity of 6-variable Boolean functions ⋮ Boolean functions with multiplicative complexity 3 and 4

This page was built for publication: Short non-interactive cryptographic proofs