Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains Without Trusted Setup
| Autor: | Ivan Pryvalov, Lucjan Hanzlik, Michael Backes, Aniket Kate, Amir Herzberg |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
050101 languages & linguistics
Theoretical computer science Computer science 05 social sciences 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences 02 engineering and technology Zero-knowledge proof Algebraic number Mathematical proof Signature (logic) |
| Zdroj: | Public-Key Cryptography – PKC 2019 ISBN: 9783030172527 Public Key Cryptography (1) |
| DOI: | 10.1007/978-3-030-17253-4_10 |
| Popis: | With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while efficient zero-knowledge proofs of algebraic statements have existed for decades, a natural challenge arose to combine algebraic and non-algebraic statements. Chase et al. (CRYPTO 2016) proposed an interactive ZK proof system for this cross-domain problem. As a use case they show that their system can be used to prove knowledge of a RSA/DSA signature on a message m with respect to a publicly known Pedersen commitment \(g^m h^r\). One drawback of their system is that it requires interaction between the prover and the verifier. This is due to the interactive nature of garbled circuits, which are used in their construction. Subsequently, Agrawal et al. (CRYPTO 2018) proposed an efficient non-interactive ZK (NIZK) proof system for cross-domains based on SNARKs, which however require a trusted setup assumption. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|