Non-interactive zero-knowledge functional proofs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1030975 (Why is no real title available?)
- A smart contract for boardroom voting with maximum voter privacy
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- An algebraic framework for Diffie-Hellman assumptions
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Compact E-Cash
- Efficient Protocols for Set Membership and Range Proofs
- Efficient range proofs with transparent setup from bounded integer commitments
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Functional encryption: definitions and challenges
- Group Signatures
- Hierarchical Predicate Encryption for Inner-Products
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved dual system ABE in prime-order groups via predicate encodings
- Improved inner-product encryption with adaptive security and full attribute-hiding
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- The Knowledge Complexity of Interactive Proof Systems
- Unbounded ABE via bilinear entropy expansion, revisited
This page was built for publication: Non-interactive zero-knowledge functional proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604930)
