Witness encryption and null-iO from evasive LWE
From MaRDI portal
(Redirected from Publication:6135397)
Recommendations
- Non-trivial witness encryption and null-iO from standard assumptions
- Towards witness encryption without multilinear maps
- Witness encryption from instance independent assumptions
- Candidate witness encryption from lattice techniques
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Witness encryption with (weak) unique decryption and message indistinguishability: constructions and applications
- Witness encryption and its applications
- Towards non-interactive witness hiding
- Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
Cites work
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate iO from homomorphic encryption schemes
- Candidate Multilinear Maps from Ideal Lattices
- Candidate obfuscation via oblivious LWE sampling
- Candidate witness encryption from lattice techniques
- Collusion resistant traitor tracing from learning with errors
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Counterexamples to new circular security assumptions underlying iO
- Cryptanalyses of Candidate Branching Program Obfuscators
- Cryptanalysis of GGH15 multilinear maps
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Cryptanalysis of the multilinear map over the integers
- Fully secure functional encryption for inner products, from standard assumptions
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph-induced multilinear maps from lattices
- Hardness of \(k\)-LWE and applications in traitor tracing
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Key homomorphic PRFs and their applications
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- New Multilinear Maps Over the Integers
- On perfect correctness in (lockable) obfuscation
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Pseudorandom functions and lattices
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
- Return of GGH15: provable security against zeroizing attacks
- Secure Obfuscation in a Weak Multilinear Map Model
- Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map
- Succinct LWE sampling, random polynomials, and obfuscation
- Witness encryption and its applications
- Witness encryption from instance independent assumptions
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
Cited in
(47)- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- Non-trivial witness encryption and null-iO from standard assumptions
- Towards witness encryption without multilinear maps
- Witness encryption with (weak) unique decryption and message indistinguishability: constructions and applications
- Witness encryption from instance independent assumptions
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Multi-authority ABE from lattices without random oracles
- Candidate witness encryption from lattice techniques
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Indistinguishability obfuscation, range avoidance, and bounded arithmetic
- Registered ABE via predicate encodings
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Lattice-based functional commitments: fast verification and cryptanalysis
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Attribute based encryption for Turing machines from lattices
- Time-lock puzzles from lattices
- Threshold encryption with silent setup
- Resettable statistical zero-knowledge for NP
- Adaptively sound zero-knowledge SNARKs for UP
- On witness encryption and laconic zero-knowledge arguments
- Simple and general counterexamples for private-coin evasive LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Efficiently-thresholdizable batched identity based encryption, with applications
- Registered ABE and adaptively-secure broadcast encryption from succinct LWE
- A generic approach to adaptively-secure broadcast encryption in the plain model
- On quantum money and evasive obfuscation
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Post-quantum PKE from unstructured noisy linear algebraic assumptions: beyond LWE and Alekhnovich's LPN
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Key revocation in registered attribute-based encryption
- Distributed broadcast encryption from lattices
- Adaptively secure attribute-based encryption from witness encryption
- Multi-client attribute-based and predicate encryption from standard assumptions
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Extractable witness encryption for KZG commitments and efficient laconic OT
- Succinct witness encryption for batch languages and applications
- Pseudorandom FE, iO and applications
- Zeroizing attacks against evasive and circular evasive LWE
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
This page was built for publication: Witness encryption and null-iO from evasive LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135397)
