The following pages link to Eike Kiltz (Q434344):
Displaying 50 items.
- Programmable hash functions and their applications (Q434345) (← links)
- An algebraic framework for Diffie-Hellman assumptions (Q514473) (← links)
- On the generic construction of identity-based signatures with additional properties (Q540392) (← links)
- Some (in)sufficient conditions for secure hybrid encryption (Q710738) (← links)
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions (Q1021236) (← links)
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles (Q1034629) (← links)
- The twin Diffie-Hellman problem and applications (Q1037234) (← links)
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model (Q1653109) (← links)
- Memory-tight reductions (Q1675721) (← links)
- A modular analysis of the Fujisaki-Okamoto transformation (Q1690199) (← links)
- On the one-per-message unforgeability of (EC)DSA and its variants (Q1690283) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Tightly-secure signatures from five-move identification protocols (Q1701435) (← links)
- Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
- Hybrid encryption in a multi-user setting, revisited (Q1749279) (← links)
- Public-key encryption resistant to parameter subversion and its realization from efficiently-embeddable groups (Q1749287) (← links)
- The algebraic group model and its applications (Q1784081) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? (Q2018816) (← links)
- Everybody's a target: scalability in public-key encryption (Q2055664) (← links)
- Generic authenticated key exchange in the quantum random oracle model (Q2055699) (← links)
- Analysing the HPKE standard (Q2056674) (← links)
- Tightly-secure authenticated key exchange, revisited (Q2056675) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Authenticated key exchange and signatures with tight security in the standard model (Q2139653) (← links)
- Efficient hybrid encryption from ID-based encryption (Q2267789) (← links)
- Lossy trapdoor permutations with improved lossiness (Q2290453) (← links)
- A modular treatment of blind signatures from identification schemes (Q2292700) (← links)
- Threshold circuit lower bounds on cryptographic functions (Q2485284) (← links)
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem (Q2489927) (← links)
- On the impossibility of purely algebraic signatures (Q2697897) (← links)
- Two-Round Man-in-the-Middle Security from LPN (Q2796127) (← links)
- Standard Security Does Imply Security Against Selective Opening for Markov Distributions (Q2796129) (← links)
- Tightly CCA-Secure Encryption Without Pairings (Q2820476) (← links)
- Optimal Security Proofs for Signatures from Identification Schemes (Q2829210) (← links)
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions (Q2845695) (← links)
- An Algebraic Framework for Diffie-Hellman Assumptions (Q2849390) (← links)
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication (Q2874517) (← links)
- Identity-Based (Lossy) Trapdoor Functions and Applications (Q2894410) (← links)
- Message Authentication, Revisited (Q2894418) (← links)
- Optimal Security Proofs for Full Domain Hash, Revisited (Q2894430) (← links)
- DDH-Like Assumptions Based on Extension Rings (Q2900250) (← links)
- On the Selective Opening Security of Practical Public-Key Encryption Schemes (Q2941185) (← links)
- Digital Signatures from Strong RSA without Prime Generation (Q2941193) (← links)
- Tightly-Secure Signatures from Chameleon Hash Functions (Q2941195) (← links)
- Quasi-Adaptive NIZK for Linear Subspaces Revisited (Q2948380) (← links)
- Efficient Authentication from Hard Learning Problems (Q3003371) (← links)
- Leakage Resilient ElGamal Encryption (Q3058681) (← links)
