Witness encryption and its applications
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Cutting-edge cryptography through the lens of secret sharing
- Registration-based encryption: removing private-key generator from IBE
- A simple construction of iO for Turing machines
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- An improved affine equivalence algorithm for random permutations
- Proofs of Work from worst-case assumptions
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- How to build time-lock encryption
- Non-trivial witness encryption and null-iO from standard assumptions
- Unbounded multi-party computation from learning with errors
- On the CCA compatibility of public-key infrastructure
- On succinct arguments and witness encryption from groups
- (Commit-and-prove) predictable arguments with privacy
- A gapless code-based hash proof system based on RQC and its applications
- Towards witness encryption without multilinear maps
- Succinct non-interactive secure computation
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Succinct non-interactive arguments via linear interactive proofs
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Simpler constructions of asymmetric primitives from obfuscation
- COA-secure obfuscation and applications
- From cryptomania to obfustopia through secret-key functional encryption
- Attribute based encryption for deterministic finite automata from DLIN
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
- Offline witness encryption from witness PRF and randomized encoding in CRS model
- Witness encryption with (weak) unique decryption and message indistinguishability: constructions and applications
- Multilinear maps from obfuscation
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Witness-based searchable encryption
- Offline witness encryption with semi-adaptive security
- Constrained pseudorandom functions from functional encryption
- The magic of ELFs
- Survey of information security
- Secret-sharing for NP
- Cryptanalysis of multilinear maps from ideal lattices: revisited
- Automated analysis of cryptographic assumptions in generic group models
- Semi-adaptively secure offline witness encryption from puncturable witness PRF
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
- Disappearing cryptography in the bounded storage model
- Multilinear maps from obfuscation
- How to avoid obfuscation using witness PRFs
- Cutting-edge cryptography through the lens of secret sharing
- Functional encryption without obfuscation
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Offline witness encryption
- Spooky Encryption and Its Applications
- Witness encryption from instance independent assumptions
- Secret-sharing for \(\mathbf {NP}\)
- Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
- Secret sharing for mNP: completeness results
- From cryptomania to obfustopia through secret-key functional encryption
- How to use indistinguishability obfuscation: deniable encryption, and more
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Witness maps and applications
- Storing and retrieving secrets on a blockchain
- Breaking the sub-exponential barrier in obfustopia
- Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
- Predictable arguments of knowledge
- Functional encryption: deterministic to randomized functions from simple assumptions
- Cryptography with updates
- One-Way Functions and (Im)perfect Obfuscation
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- On the complexity of compressing obfuscation
- Explainable arguments
- Multi-key and multi-input predicate encryption from learning with errors
- Laconic function evaluation for Turing machines
- A map of witness maps: new definitions and connections
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Identity-based encryption in DDH hard groups
- Witness encryption from smooth projective hashing system
- Multi-authority ABE from lattices without random oracles
- ABE for circuits with constant-size secret keys and adaptive security
- Fully-secure MPC with minimal trust
- Witness encryption and null-iO from evasive LWE
- Concurrently composable non-interactive secure computation
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- SNARGs for monotone policy batch NP
- Candidate witness encryption from lattice techniques
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Astrolabous: a universally composable time-lock encryption scheme
- Forward-secure public key encryption without key update from proof-of-stake blockchain
- Smooth zero-knowledge hash functions
- Universal ring signatures in the standard model
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Indistinguishability obfuscation, range avoidance, and bounded arithmetic
- A gapless post-quantum hash proof system in the Hamming metric
- Ciphertext policy attribute-based encryption for circuits from LWE assumption
- Short concurrent covert authenticated key exchange (short cAKE)
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions
- McFly: verifiable encryption to the future made practical
- Registered ABE via predicate encodings
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
This page was built for publication: Witness encryption and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495817)
