Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
From MaRDI portal
Publication:2289212
DOI10.1007/978-3-030-17253-4_10zbMath1465.94056OpenAlexW2920360623MaRDI QIDQ2289212
Michael Backes, Ivan Pryvalov, Amir Herzberg, Lucjan Hanzlik, Aniket Kate
Publication date: 28 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17253-4_10
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)
Related Items (3)
Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Public-key generation with verifiable randomness
Uses Software
Cites Work
This page was built for publication: Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup