Candidate indistinguishability obfuscation and functional encryption for all circuits
From MaRDI portal
Cited in
(52)- FE for inner products and its application to multi-authority ABE
- On witness encryption and laconic zero-knowledge arguments
- Lattice-based obfuscation from NTRU and equivocal LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- Pseudorandom obfuscation and applications
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- On one-shot signatures, quantum vs. classical binding, and obfuscating permutations
- How to model unitary oracles
- Foundations of platform-assisted auctions
- Simultaneous-message and succinct secure computation
- Optimal traitor tracing from pairings
- On quantum money and evasive obfuscation
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Hierarchical functional encryption for quadratic transformation
- Homomorphic indistinguishability obfuscation and its applications
- A simple inner-product functional encryption scheme from the inverse-DDH assumption
- Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
- Cryptography. Abstracts from the workshop held January 19--24, 2025
- Multi-client attribute-based and predicate encryption, revisited
- Multi-client attribute-based unbounded inner product functional encryption, and more
- Tight adaptive simulation security for identity-based inner-product FE in the (quantum) random oracle model
- Registration-based encryption in the plain model
- Non-committing identity based encryption: constructions and applications
- Adaptively-secure big-key identity-based encryption
- Distributed broadcast encryption from lattices
- Limits on adaptive security for attribute-based encryption
- Multi-client attribute-based and predicate encryption from standard assumptions
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Signature-based witness encryption with compact ciphertext
- Leakage-resilient incompressible cryptography: constructions and barriers
- Jackpot: non-interactive aggregatable lotteries
- Extractable witness encryption for KZG commitments and efficient laconic OT
- Indistinguishability obfuscation from well-founded assumptions
- When KGC meets curator: new paradigm of registered ABE and FE
- Succinct computational secret sharing for monotone circuits
- Succinct witness encryption for batch languages and applications
- Lower bounds on inner-product functional encryption from all-or-nothing encryption primitives
- A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
- Obfuscating pseudorandom functions is post-quantum complete
- (Multi-input) \textsf{FE} for randomized functionalities, revisited
- Adaptively secure streaming functional encryption
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- How to copy-protect malleable-puncturable cryptographic functionalities under arbitrary challenge distributions: a unified solution to quantum protection
- On the cryptographic futility of non-collapsing measurements
- Traceable secret sharing revisited
- Simultaneous-message and succinct secure computation: reusable and multiparty protocols
- \textsf{Zebra}: arithmetic garbled RAM for large words from DCR
- Lower bounds on the overhead of indistinguishability obfuscation
- Unbounded quadratic functional encryption and more from pairings
This page was built for publication: Candidate indistinguishability obfuscation and functional encryption for all circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981772)
