To label, or not to label (in generic groups)
From MaRDI portal
Publication:6163942
DOI10.1007/978-3-031-15982-4_3zbMath1517.94169MaRDI QIDQ6163942
Publication date: 30 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Related Items (9)
Generic models for group actions ⋮ A lower bound on the length of signatures based on group actions and generic isogenies ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ An analysis of the algebraic group model ⋮ On the impossibility of algebraic NIZK in pairing-free groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Impossibility of order-revealing encryption in idealized models
- The Discrete Logarithm problem with preprocessing
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Identity-based encryption from the Diffie-Hellman assumption
- The algebraic group model and its applications
- Complexity of a determinate algorithm for the discrete logarithm
- Optimal broadcast encryption from pairings and LWE
- Generic-group delay functions require hidden-order groups
- A classification of computational assumptions in the algebraic group model
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction
- On the security of time-lock puzzles and timed commitments
- Tight state-restoration soundness in the algebraic group model
- On the multi-user security of short Schnorr signatures with preprocessing
- On the impossibility of purely algebraic signatures
- Automated Analysis of Cryptographic Assumptions in Generic Group Models
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Deterministic and Efficiently Searchable Encryption
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- On the existence of extractable one-way functions
- Random-Oracle Uninstantiability from Indistinguishability Obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- On the Equivalence of Generic Group Models
- Cryptography and Coding
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
This page was built for publication: To label, or not to label (in generic groups)