Everybody's a target: scalability in public-key encryption
From MaRDI portal
Publication:2055664
DOI10.1007/978-3-030-45727-3_16zbMath1479.94117OpenAlexW2946969716MaRDI QIDQ2055664
Benedikt Auerbach, Federico Giacon, Eike Kiltz
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_16
Related Items (4)
Tightness subtleties for multi-user PKE notions ⋮ Multi-instance secure public-key encryption ⋮ Algebraic adversaries in the universal composability framework ⋮ Everybody's a target: scalability in public-key encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Discrete Logarithm problem with preprocessing
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- The algebraic group model and its applications
- Everybody's a target: scalability in public-key encryption
- On tightly secure primitives in the multi-instance setting
- Tight reductions for Diffie-Hellman variants in the algebraic group model
- The distinction between fixed and random generators in group-based assumptions
- Batch NFS
- The multiple number field sieve for medium- and high-characteristic finite fields
- Multi-instance Security and Its Application to Password-Based Cryptography
- Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
- Generic Hardness of the Multiple Discrete Logarithm Problem
- Resource-based corruptions and the combinatorics of hidden diversity
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Cryptography and Coding
This page was built for publication: Everybody's a target: scalability in public-key encryption
