Pages that link to "Item:Q5495817"
From MaRDI portal
The following pages link to Witness encryption and its applications (Q5495817):
Displaying 41 items.
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More (Q4989921) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Witness Maps and Applications (Q5041158) (← links)
- Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits (Q5738750) (← links)
- Predictable Arguments of Knowledge (Q5738785) (← links)
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
- Cryptography with Updates (Q5738983) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Explainable arguments (Q6045191) (← links)
- Identity-based encryption in DDH hard groups (Q6103077) (← links)
- Multi-authority ABE from lattices without random oracles (Q6114256) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- Witness encryption and null-iO from evasive LWE (Q6135397) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees (Q6135431) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- Candidate witness encryption from lattice techniques (Q6155267) (← links)
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication (Q6157506) (← links)
- Astrolabous: a universally composable time-lock encryption scheme (Q6157525) (← links)
- Forward-secure public key encryption without key update from proof-of-stake blockchain (Q6157602) (← links)
- Smooth zero-knowledge hash functions (Q6157605) (← links)
- Universal ring signatures in the standard model (Q6175977) (← links)
- Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE (Q6488031) (← links)
- A gapless post-quantum hash proof system in the Hamming metric (Q6535099) (← links)
- Ciphertext policy attribute-based encryption for circuits from LWE assumption (Q6536220) (← links)
- Short concurrent covert authenticated key exchange (short cAKE) (Q6562580) (← links)
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors (Q6570526) (← links)
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions (Q6573953) (← links)
- McFly: verifiable encryption to the future made practical (Q6573969) (← links)
- Registered ABE via predicate encodings (Q6604925) (← links)
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces (Q6604928) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q6617635) (← links)
- PURED: a unified framework for resource-hard functions (Q6623350) (← links)
- Witness encryption for succinct functional commitments and applications (Q6635767) (← links)
- Time-lock puzzles from lattices (Q6652906) (← links)
- Resettable statistical zero-knowledge for NP (Q6653049) (← links)
