Efficiently-thresholdizable batched identity based encryption, with applications
From MaRDI portal
Cites work
- Algebraic group model with oblivious sampling
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate witness encryption from lattice techniques
- Constant-Size Commitments to Polynomials and Their Applications
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- scientific article; zbMATH DE number 1618057 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1304079 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- McFly: verifiable encryption to the future made practical
- On Computing Logarithms Over Finite Fields
- Threshold encryption with silent setup
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- To label, or not to label (in generic groups)
- Witness encryption and its applications
- Witness encryption and null-iO from evasive LWE
This page was built for publication: Efficiently-thresholdizable batched identity based encryption, with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863938)
