Zero-knowledge proofs for committed symmetric Boolean functions

DOI10.1007/978-3-030-81293-5_18zbMATH Open1485.94106OpenAlexW3180723629MaRDI QIDQ2118554FDOQ2118554

Huaxiong Wang, Duong Hieu Phan, Hanh Tang, San Ling, Hoa Nguyen

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_18

zbMATH Keywords

symmetric Boolean functionslearning-parity-with-noise assumption

Mathematics Subject Classification ID

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 (5)

• Provably Hard Zero-Way Functions
• Bicameral and auditably private signatures
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
• Fully dynamic attribute-based signatures for circuits from codes

Uses Software

• Ligero
• ZKBoo
• Libra

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Zero-Knowledge Proofs 👍 👎
• Zero‐Knowledge Proofs 👍 👎

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)