The following pages link to (Q4364544):
Displaying 27 items.
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Privacy-preserving file sharing on cloud storage with certificateless signcryption (Q2143126) (← links)
- Incompressible cryptography (Q2170026) (← links)
- Anamorphic encryption: private communication against a dictator (Q2170036) (← links)
- Deniable searchable symmetric encryption (Q2293186) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- A new framework for deniable secure key exchange (Q2672249) (← links)
- Disappearing cryptography in the bounded storage model (Q2697865) (← links)
- Standard Security Does Imply Security Against Selective Opening for Markov Distributions (Q2796129) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Selective Opening Security from Simulatable Data Encapsulation (Q2953779) (← links)
- A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys (Q3102797) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Deniable Attribute Based Encryption for Branching Programs from LWE (Q3181031) (← links)
- A Plausibly Deniable Encryption Scheme Utilizing PUF’s Thermo-Sensitivity (Q3297484) (← links)
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol (Q3593091) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More (Q4989921) (← links)
- No-Key Protocol for Deniable Encryption (Q5117270) (← links)
- Deniability of Symmetric Encryption Based on Computational Indistinguishability from Probabilistic Ciphering (Q5117282) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- Watermarking cryptographic functionalities from standard lattice assumptions (Q5918350) (← links)
- On elliptic curve $L$-functions integrated encryption scheme (Q6196946) (← links)