Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
From MaRDI portal
Publication:2953792
DOI10.1007/978-3-662-53890-6_22zbMath1380.94078OpenAlexW2553733191MaRDI QIDQ2953792
Mary Maller, Melissa Chase, Sarah Meiklejohn
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_22
Related Items (8)
Skipping the \(q\) in group signatures ⋮ Rerandomizable signatures under standard assumption ⋮ Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ Master-key KDM-secure ABE via predicate encoding ⋮ A classification of computational assumptions in the algebraic group model
Cites Work
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Cryptographic Assumptions: A Position Paper
- Déjà Q: Encore! Un Petit IBE
- A Framework for Identity-Based Encryption with Almost Tight Security
- Compactly Hiding Linear Spans
- Tightly CCA-Secure Encryption Without Pairings
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- Tightly Secure Signatures and Public-Key Encryption
- Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
- A Profitable Sub-prime Loan: Obtaining the Advantages of Composite Order in Prime-Order Bilinear Groups
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Identity-Based Encryption Secure against Selective Opening Attack
- Unbounded HIBE and Attribute-Based Encryption
- Decentralizing Attribute-Based Encryption
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Lossy trapdoor functions and their applications
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Security Analysis of the Strong Diffie-Hellman Problem
- The Uber-Assumption Family
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Dual Form Signatures: An Approach for Proving Security from Static Assumptions
- Tightly-Secure Authenticated Key Exchange
- Advances in Cryptology - EUROCRYPT 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Déjà Q: Using Dual Systems to Revisit q-Type Assumptions
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Public Key Cryptography - PKC 2005
- Theory of Cryptography
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
This page was built for publication: Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
