On the impossibility of purely algebraic signatures
From MaRDI portal
Publication:2697897
DOI10.1007/978-3-030-90456-2_11OpenAlexW3213317311MaRDI QIDQ2697897
Sven Schäge, Dominik Hartmann, Bogdan Ursu, Nico Döttling, Eike Kiltz, Dennis Hofheinz
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_11
Related Items (6)
A lower bound on the length of signatures based on group actions and generic isogenies ⋮ Identity-based encryption in DDH hard groups ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ To label, or not to label (in generic groups) ⋮ On the impossibility of algebraic NIZK in pairing-free groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Impossibility of order-revealing encryption in idealized models
- Verifiable delay functions
- Identity-based encryption from the Diffie-Hellman assumption
- Lower bounds on structure-preserving signatures for bilateral messages
- Practical chosen ciphertext secure encryption from factoring
- Generic-group delay functions require hidden-order groups
- Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
- Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- A linear space algorithm for computing the hermite normal form
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Identity-Based Cryptosystems and Signature Schemes
- Short Signatures from Weaker Assumptions
- Short and Stateless Signatures from the RSA Assumption
- Programmable Hash Functions and Their Applications
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Dual Form Signatures: An Approach for Proving Security from Static Assumptions
- Simple verifiable delay functions
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Cryptography and Coding
- Efficient verifiable delay functions
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
This page was built for publication: On the impossibility of purely algebraic signatures
