The following pages link to (Q4409113):
Displaying 50 items.
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles (Q387810) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Non-adaptive programmability of random oracle (Q500974) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- A synthetic indifferentiability analysis of some block-cipher-based hash functions (Q1009050) (← links)
- Oracles for structural properties: The isomorphism problem and public-key cryptography (Q1190988) (← links)
- Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security (Q1633451) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games (Q2019479) (← links)
- Tightly-secure authenticated key exchange, revisited (Q2056675) (← links)
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work (Q2056756) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- Handling adaptive compromise for practical encryption schemes (Q2096475) (← links)
- Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
- Fully deniable interactive encryption (Q2096511) (← links)
- Authenticated key exchange and signatures with tight security in the standard model (Q2139653) (← links)
- A unified and composable take on ratcheting (Q2175936) (← links)
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation (Q2210436) (← links)
- Fine-grained forward-secure signature schemes without random oracles (Q2489913) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting (Q2692342) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- Virtual Smart Cards: How to Sign with a Password and a Server (Q2827728) (← links)
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation (Q2827742) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case (Q2835591) (← links)
- Selective-Opening Security in the Presence of Randomness Failures (Q2953780) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- Universally Composable Cryptographic Role-Based Access Control (Q2953848) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks (Q2975822) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Designated Confirmer Signatures with Unified Verification (Q3104715) (← links)
- Receiver Selective Opening Security from Indistinguishability Obfuscation (Q3179497) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Oracle Separation in the Non-uniform Model (Q3651594) (← links)
- Modeling Random Oracles Under Unpredictable Queries (Q4639493) (← links)
