The following pages link to Dennis Hofheinz (Q300381):
Displaying 50 items.
- Tightly secure signatures and public-key encryption (Q300383) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Some (in)sufficient conditions for secure hybrid encryption (Q710738) (← links)
- More efficient (almost) tightly secure structure-preserving signatures (Q1648830) (← links)
- Kurosawa-Desmedt meets tight security (Q1675198) (← links)
- Compact structure-preserving signatures with almost tight security (Q1680229) (← links)
- A modular analysis of the Fujisaki-Okamoto transformation (Q1690199) (← links)
- Identity-based encryption tightly secure under chosen-ciphertext attacks (Q1710596) (← links)
- Interactively secure groups from obfuscation (Q1753857) (← links)
- Graded encoding schemes from obfuscation (Q1753858) (← links)
- On tightly secure non-interactive key exchange (Q1784082) (← links)
- (Q1877354) (redirect page) (← links)
- On the security of two public key cryptosystems using non-abelian groups (Q1877355) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- On the (im-)possibility of extending coin toss (Q1994641) (← links)
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? (Q2018816) (← links)
- Confined guessing: new signatures from standard assumptions (Q2018822) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Dual-mode NIZKs from obfuscation (Q2181885) (← links)
- Multilinear maps from obfuscation (Q2188963) (← links)
- Obfuscation for cryptographic purposes (Q2267356) (← links)
- On tightly secure primitives in the multi-instance setting (Q2289224) (← links)
- Designated-verifier pseudorandom generators, and their applications (Q2292885) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- Adaptively secure constrained pseudorandom functions (Q2656914) (← links)
- Towards tight adaptive security of non-interactive key exchange (Q2697896) (← links)
- On the impossibility of purely algebraic signatures (Q2697897) (← links)
- Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography (Q2796128) (← links)
- Verifiable Random Functions from Standard Assumptions (Q2796131) (← links)
- Reconfigurable Cryptography: A Flexible Approach to Long-Term Security (Q2796136) (← links)
- Multilinear Maps from Obfuscation (Q2796137) (← links)
- Idealizing Identity-Based Encryption (Q2811144) (← links)
- Tightly CCA-Secure Encryption Without Pairings (Q2820476) (← links)
- Programmable Hash Functions in the Multilinear Setting (Q2845692) (← links)
- Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations (Q2874509) (← links)
- All-But-Many Lossy Trapdoor Functions (Q2894409) (← links)
- Waters Signatures with Optimal Security Reduction (Q2900209) (← links)
- On Definitions of Selective Opening Security (Q2900240) (← links)
- Tightly Secure Signatures and Public-Key Encryption (Q2914286) (← links)
- Universally Composable Non-Interactive Key Exchange (Q2922650) (← links)
- Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting (Q2941221) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- Short Signatures from Weaker Assumptions (Q3102214) (← links)
- Standard Security Does Not Imply Indistinguishability Under Selective Opening (Q3181024) (← links)
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts (Q3181025) (← links)
- The Group of Signed Quadratic Residues and Applications (Q3183589) (← links)
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems (Q3408192) (← links)
