How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
From MaRDI portal
Publication:6190121
DOI10.1007/978-3-031-38551-3_16OpenAlexW4385654684MaRDI QIDQ6190121
David J. Wu, Cody Freitag, Brent Waters
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_16
Cites Work
- Registration-based encryption: removing private-key generator from IBE
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- From obfuscation to the security of Fiat-Shamir for proofs
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Non-trivial witness encryption and null-iO from standard assumptions
- Optimal broadcast encryption from pairings and LWE
- SPARKs: succinct parallelizable arguments of knowledge
- Optimal broadcast encryption from LWE and pairings in the standard model
- On perfect correctness in (lockable) obfuscation
- Verifiable registration-based encryption
- On succinct arguments and witness encryption from groups
- Fully deniable interactive encryption
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin
- Optimizing registration based encryption
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Collusion resistant broadcast and trace from positional witness encryption
- Registration-based encryption from standard assumptions
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- How to Run Turing Machines on Encrypted Data
- Constrained Pseudorandom Functions and Their Applications
- Low Overhead Broadcast Encryption from Multilinear Maps
- Witness Encryption from Instance Independent Assumptions
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Public Key Broadcast Encryption for Stateless Receivers
- Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- A Depth-Universal Circuit
- How to use indistinguishability obfuscation
- Fuzzy Identity-Based Encryption
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Witness encryption and its applications
- Predictable Arguments of Knowledge
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Registered attribute-based encryption
- Indistinguishability obfuscation from well-founded assumptions
- Witness encryption and null-iO from evasive LWE
- Candidate witness encryption from lattice techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
