Doubly efficient interactive proofs over infinite and non-commutative rings
From MaRDI portal
Publication:6169369
DOI10.1007/978-3-031-22318-1_18zbMath1519.94188OpenAlexW4312871315MaRDI QIDQ6169369
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22318-1_18
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-deterministic exponential time has two-prover interactive protocols
- Reductions in computational complexity using Clifford algebras
- Flexible and efficient verifiable computation on encrypted data
- Sumcheck arguments and their applications
- Efficient information-theoretic multi-party computation over non-commutative rings
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- Practical verified computation with streaming interactive proofs
- IP = PSPACE Using Error-Correcting Codes
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae
- Delegating Computation
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- The Knowledge Complexity of Interactive Proof Systems
- Algebraic methods for interactive proof systems
- Advances in Cryptology - EUROCRYPT 2004
- On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
- Doubly efficient interactive proofs over infinite and non-commutative rings
This page was built for publication: Doubly efficient interactive proofs over infinite and non-commutative rings
