Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International Conference on the Theory and Application of Cryptology and Information Security

• Publication date

  2017-12-03

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-70697-9_3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials

  2018cited by this paper
• Automated Analysis of Cryptographic Assumptions in Generic Group Models

  2018cited by this paper
• Cryptographic Assumptions: A Position Paper

  2016cited by this paper
• Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions

  2016cited by this paper
• The Kernel Matrix Diffie-Hellman Assumption

  2016cited by this paper
• Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model

  2016cited by this paper
• An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security

  2015influential reference
• An Algebraic Framework for Diffie–Hellman Assumptions

  2015cited by this paper
• Deja Q: Using Dual Systems to Revisit q-Type Assumptions

  2014cited by this paper
• Quadratic Span Programs and Succinct NIZKs without PCPs

  2013cited by this paper
• Security Ranking Among Assumptions Within the Uber Assumption Framework

  2013cited by this paper
• The square root Diffie–Hellman problem

  2012cited by this paper
• The square root Diffie–Hellman problem

  2011cited by this paper
• Identity-Based Encryption Secure against Selective Opening Attack

  2011cited by this paper
• On the Analysis of Cryptographic Assumptions in the Generic Ring Model

  2009cited by this paper
• The Uber-Assumption Family

  2008cited by this paper
• Pairings for Cryptographers

  2008cited by this paper
• Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

  2008influential reference
• Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

  2008cited by this paper
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures

  2007cited by this paper
• Another look at generic groups

  2007cited by this paper
• A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness

  2007cited by this paper
• Security Analysis of the Strong Diffie-Hellman Problem

  2006cited by this paper
• Hierarchical Identity Based Encryption with Constant Size Ciphertext

  2005influential reference
• Abstract Models of Computation in Cryptography

  2005cited by this paper
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys

  2005influential reference
• Complexity Analysis of the Cryptographic Primitive Problems through Square-Root Exponent

  2004influential reference
• The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols

  2004cited by this paper
• On Cryptographic Assumptions and Challenges

  2003cited by this paper
• Variations of Diffie-Hellman Problem

  2003cited by this paper
• The Group Diffie-Hellman Problems

  2002cited by this paper
• A New Traitor Tracing

  2002cited by this paper
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model

  2002cited by this paper
• A Tool Box of Cryptographic Functions Related to the Diffie-Hellman Function

  2001cited by this paper
• Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference

  2001cited by this paper
• Lower Bounds for Discrete Logarithms and Related Problems

  1997cited by this paper
• Diffie-Hellman Oracles

  1996influential reference
• Complexity of a determinate algorithm for the discrete logarithm

  1994cited by this paper
• Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

  1994cited by this paper
• Diffie-Hellman is as Strong as Discrete Log for Certain Primes

  1988cited by this paper

• RCBPS: Revocable Certificate-based Proxy Signature Scheme in the Standard Model for Secure CloudIoT Communications

  2026cites this paper
• Baloo: Algebraic Lookup Arguments

  2025cites this paper
• Revisiting Discrete Logarithm Reductions

  2025cites this paper
• On the Concrete Security of BBS/BBS+ Signatures

  2025cites this paper
• Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal

  2023cites this paper
• Baloo: Nearly Optimal Lookup Arguments

  2022cites this paper
• Caulk: Lookup Arguments in Sublinear Time

  2022cites this paper
• A Classification of Computational Assumptions in the Algebraic Group Model

  2020cites this paper
• Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions

  2020cites this paper
• Practical zero-knowledge arguments from structured reference strings

  2019cites this paper
• New techniques for the modular analysis of digital signature schemes

  2019cites this paper
• On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups

  2019influential citation
• Sublinear Pairing-based Arguments with Updatable CRS and Weaker Assumptions

  2019cites this paper
• Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model

  2019cites this paper
• Shorter Pairing-Based Arguments Under Standard Assumptions

  2019cites this paper
• Updatable and Universal Common Reference Strings with Applications to zk-SNARKs

  2018cites this paper
• The Algebraic Group Model and its Applications

  2018cites this paper
• Towards Static Assumption Based Cryptosystem in Pairing Setting: Further Applications of DéjàQ and Dual-Form Signature

  2018cites this paper
• Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs

  2017cites this paper
• S 𝔲𝔟𝔩𝔬𝔫 K : Sublinear Prover P 𝔩𝔬𝔫 K

  year unknowncites this paper