Witness encryption for succinct functional commitments and applications
From MaRDI portal
Publication:6635767
DOI10.1007/978-3-031-57722-2_5MaRDI QIDQ6635767
Hamidreza Khoshakhlagh, Dario Fiore, Matteo Campanelli
Publication date: 12 November 2024
secure multiparty computationwitness encryptionsmooth projective hash functionsfunctional commitments
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unbounded ABE via bilinear entropy expansion, revisited
- The algebraic group model and its applications
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Multiparty reusable non-interactive secure computation from LWE
- On succinct arguments and witness encryption from groups
- (Commit-and-prove) predictable arguments with privacy
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Mr NISC: multiparty reusable non-interactive secure computation
- Subvector commitments with application to succinct arguments
- Succinct functional commitment for a large class of arithmetic circuits
- On the Hardness of Proving CCA-Security of Signed ElGamal
- Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- Witness Encryption from Instance Independent Assumptions
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Identity-Based Cryptosystems and Signature Schemes
- Unbounded HIBE and Attribute-Based Encryption
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
- New directions in cryptography
- Identity-Based Encryption from the Weil Pairing
- Fuzzy Identity-Based Encryption
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Witness encryption and its applications
- On the Size of Pairing-Based Non-interactive Arguments
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- Indistinguishability obfuscation from well-founded assumptions
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Chainable functional commitments for unbounded-depth circuits
This page was built for publication: Witness encryption for succinct functional commitments and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635767)
