Improved zero-knowledge argument of encrypted extended permutation
From MaRDI portal
Publication:2151308
DOI10.1007/978-3-030-88323-2_15zbMath1492.94143OpenAlexW3206949601MaRDI QIDQ2151308
Publication date: 1 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88323-2_15
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure circuit evaluation. A protocol based on hiding information from an oracle
- Efficient secure two-party protocols. Techniques and constructions
- Parallel coin-tossing and constant-round secure two-party computation
- More efficient universal circuit constructions
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Efficient and scalable universal circuits
- Valiant’s Universal Circuit is Practical
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Actively Secure Private Function Evaluation
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Constant-Round Private Function Evaluation with Linear Complexity
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Universal circuits (Preliminary Report)
- Foundations of Cryptography
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: Improved zero-knowledge argument of encrypted extended permutation
