Zero-knowledge proofs for committed symmetric Boolean functions
From MaRDI portal
Publication:2118554
DOI10.1007/978-3-030-81293-5_18zbMATH Open1485.94106OpenAlexW3180723629MaRDI QIDQ2118554FDOQ2118554
Authors: San Ling, Hoa Nguyen, Duong Hieu Phan, Hanh Tang, Huaxiong Wang 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_18
Recommendations
- scientific article; zbMATH DE number 4195166
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Zero knowledge with efficient provers
- Zero-knowledge proofs from secure multiparty computation
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Composition of zero-knowledge proofs with efficient provers
- scientific article; zbMATH DE number 1304185
- scientific article; zbMATH DE number 94166
- Zero-Knowledge Proofs
- Zero‐Knowledge Proofs
Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Boolean functions (94D10)
Cites Work
- Minimum disclosure proofs of knowledge
- Title not available (Why is that?)
- The knowledge complexity of interactive proof-systems
- Oblivious transfer with hidden access control from attribute-based encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- A new paradigm for public key identification
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Applied Cryptography and Network Security
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Policy-Based Signatures
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Title not available (Why is that?)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A code-based group signature scheme
- Title not available (Why is that?)
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Provably Secure Code-Based Threshold Ring Signatures
- Adaptive oblivious transfer with access control from lattice assumptions
- Provably Secure Group Signature Schemes From Code-Based Assumptions
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Universal circuits (Preliminary Report)
- Libra: succinct zero-knowledge proofs with optimal prover computation
- A code-based linkable ring signature scheme
- Valiant's universal circuit is practical
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- On the size of pairing-based non-interactive arguments
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Two-round oblivious transfer from CDH or LPN
- New code-based privacy-preserving cryptographic constructions
- Zero-knowledge protocols for the McEliece encryption
- Universally composable oblivious transfer based on a variant of LPN
Cited In (9)
- Provably Hard Zero-Way Functions
- Bicameral and auditably private signatures
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Fully dynamic attribute-based signatures for circuits from codes
- Code-Based Zero Knowledge PRF Arguments
- New code-based privacy-preserving cryptographic constructions
- Commitments with efficient zero-knowledge arguments from subset sum problems
Uses Software
This page was built for publication: Zero-knowledge proofs for committed symmetric Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118554)
