Cryptographic Assumptions: A Position Paper

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Theory of Cryptography Conference

• Publication date

  2016-01-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-49096-9_21
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Hunting of the SNARK

  2016cited by this paper
• Cryptanalysis of the New CLT Multilinear Map over the Integers

  2016cited by this paper
• Cryptanalysis of the New CLT Multilinear Maps

  2015cited by this paper
• Cryptanalysis of the New Multilinear Map over the Integers

  2015cited by this paper
• Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption

  2015cited by this paper
• Succinct Randomized Encodings and their Applications

  2015cited by this paper
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings

  2014cited by this paper
• Cryptanalysis of the Multilinear Map over the Integers

  2014cited by this paper
• Protecting Obfuscation against Algebraic Attacks

  2014cited by this paper
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic

  2014cited by this paper
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

  2014cited by this paper
• Constant-Round Concurrent Zero Knowledge from P-Certificates

  2013cited by this paper
• Classical hardness of learning with errors

  2013cited by this paper
• Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

  2013cited by this paper
• Secure Two-Party Computation with Low Communication

  2012cited by this paper
• Candidate One-Way Functions Based on Expander Graphs

  2011cited by this paper
• Randomness and Computation

  2011cited by this paper
• Separating succinct non-interactive arguments from all falsifiable assumptions

  2011cited by this paper
• Robustness of the Learning with Errors Assumption

  2010cited by this paper
• Efficient Public Key Encryption Based on Ideal Lattices

  2009cited by this paper
• Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

  2009cited by this paper
• Succinct NP Proofs from an Extractability Assumption

  2008cited by this paper
• Trapdoors for hard lattices and new cryptographic constructions

  2008cited by this paper
• Uniform direct product theorems: simplified, optimized, and derandomized

  2008cited by this paper
• Foundations of Cryptography: Volume 1

  2006cited by this paper
• On lattices, learning with errors, random linear codes, and cryptography

  2005cited by this paper
• On obfuscating point functions

  2005cited by this paper
• Short Group Signatures

  2004cited by this paper
• More on Average Case vs Approximation Complexity

  2003cited by this paper
• On Cryptographic Assumptions and Challenges

  2003cited by this paper
• On the (In)security of the Fiat-Shamir paradigm

  2003cited by this paper
• Complexity of lattice problems - a cryptographic perspective

  2002cited by this paper
• Complexity of lattice problems

  2002cited by this paper
• The Foundations of Cryptography - Volume 1: Basic Techniques

  2001cited by this paper
• The Foundations of Cryptography - Volume 1, Basic Techniques.

  2001cited by this paper
• How to go beyond the black-box simulation barrier

  2001cited by this paper
• The random oracle methodology, revisited

  2000cited by this paper
• Noise-tolerant learning, the parity problem, and the statistical query model

  2000cited by this paper
• On the Limits of Nonapproximability of Lattice Problems

  2000cited by this paper
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  1999cited by this paper
• Computationally Private Information Retrieval with Polylogarithmic Communication

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

  1997cited by this paper
• Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information

  1997cited by this paper
• Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations

  1997cited by this paper
• Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees

  1997cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)

  1996cited by this paper
• Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks

  1991cited by this paper
• Searching for primitive roots in finite fields

  1990cited by this paper
• A hard-core predicate for all one-way functions

  1989cited by this paper
• New algorithms for finding irreducible polynomials over finite fields

  1988cited by this paper
• How to Prove Yourself: Practical Solutions to Identification and Signature Problems

  1986cited by this paper
• Probabilistic Encryption

  1984cited by this paper
• DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

  1979cited by this paper
• A method for obtaining digital signatures and public-key cryptosystems

  1978cited by this paper
• New Directions in Cryptography

  1976cited by this paper
• private communication

  1969cited by this paper
• Available from the IACR Cryptology ePrint Archive as Report 2008/510. Reconstructing RSA Private Keys from Random Key Bits

  year unknowncited by this paper

• Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy

  2026cites this paper
• Gödel in Cryptography: Effectively Zero-Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness

  2025cites this paper
• Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P Hardness

  2025cites this paper
• Deep Learning-Based Defect Identification for Quantum Key Distribution Devices

  2025cites this paper
• Private Map-Secure Reduce: Infrastructure for Efficient AI Data Markets

  2025cites this paper
• Ad Hoc Traitor Tracing: A Decentralized Framework for Cybersecurity and Secure Group Communications

  2025cites this paper
• Quantum Time Capsules

  2025cites this paper
• Intelligent IoT Data Analytics: A Machine Learning and Deep Learning Approach

  2025cites this paper
• Delphi: sharing assessments of cryptographic assumptions

  2024cites this paper
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States

  2024cites this paper
• Boosting SNARKs and Rate-1 Barrier in Arguments of Knowledge

  2024cites this paper
• Challenges in Timed Cryptography: A Position Paper

  2024cites this paper
• Ad Hoc Broadcast, Trace, and Revoke: Plus Time-Space Trade-Offs for Attribute-Based Encryption

  2024cites this paper
• Separating Selective Opening Security From Standard Security, Assuming IO

  2024cites this paper
• Bit Security as Cost to Demonstrate Advantage

  2024cites this paper
• The Uber-Knowledge Assumption: A Bridge to the AGM

  2024cites this paper
• A Resource-Adaptive Routing Scheme with Wavelength Conflicts in Quantum Key Distribution Optical Networks

  2023cites this paper
• Citadel: Self-Sovereign Identities on Dusk Network

  2023cites this paper
• Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions

  2022cites this paper
• Washington University Open Scholarship Washington University Open Scholarship

  2022cites this paper
• Set (Non-)Membership NIZKs from Determinantal Accumulators

  2022cites this paper
• Ad Hoc (Decentralized) Broadcast, Trace, and Revoke

  2022cites this paper
• SoK: Assumptions Underlying Cryptocurrency Deanonymizations

  2022influential citation
• Unified View for Notions of Bit Security

  2022cites this paper
• FORT: Right-proving and Attribute-blinding Self-sovereign Authentication

  2022cites this paper
• On Heuristic Models, Assumptions, and Parameters

  2022influential citation
• ZPiE: Zero-knowledge Proofs in Embedded systems

  2021cites this paper
• Towards Generation of Indistinguishable Decoy State-Glauber State using a Tuned Laser Diode

  2021cites this paper
• UPPRESSO: Untraceable and Unlinkable Privacy-PREserving Single Sign-On Services

  2021cites this paper
• Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness

  2021cites this paper
• Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P

  2021cites this paper
• Cryptographic Problems in the Context of Data Markets

  2021cites this paper
• CSP-Completeness And Its Applications

  2020cites this paper
• Cryptographic Obfuscation: A Survey

  2020cites this paper
• MuSig2: Simple Two-Round Schnorr Multi-Signatures

  2020cites this paper
• SANS: Self-sovereign Authentication for Network Slices

  2020cites this paper
• Mathematics and Computation

  2019cites this paper
• Fiat-Shamir: from practice to theory

  2019cites this paper
• Comparing proofs of security for lattice-based encryption

  2019cites this paper
• Adversarially Robust Learning Could Leverage Computational Hardness

  2019cites this paper
• The Distinction Between Fixed and Random Generators in Group-Based Assumptions

  2019cites this paper
• Critical perspectives on provable security: Fifteen years of "another look" papers

  2019cites this paper
• Permuted Puzzles and Cryptographic Hardness

  2019cites this paper
• Group-Based Key Exchange Protocol Based on Complete Decomposition Search Problem

  2019cites this paper
• The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks

  2018cites this paper
• Preventing Zeroizing Attacks on GGH15

  2018cites this paper
• Return of GGH15: Provable Security Against Zeroizing Attacks

  2018cites this paper
• On the nature of the Theory of Computation (ToC)

  2018cites this paper
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge

  2018cites this paper
• Semantic Security Invariance under Variant Computational Assumptions

  2018influential citation
• Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound

  2018cites this paper
• Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications)

  2018cites this paper
• Zero-knowledge proofs for secure computation

  2017cites this paper
• Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups

  2017cites this paper
• Advances in public-key cryptology and computer exploitation. (Avancées en cryptologie à clé publique et exploitation informatique)

  2017cites this paper
• Robust Transfroming Combiners from iO to FE Prabhanjan Ananth

  2017cites this paper
• Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness

  2017cites this paper
• Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption

  2017cites this paper
• A Formal Security Analysis of the Signal Messaging Protocol

  2017cites this paper
• Multimodal Indexable Encryption for Mobile Cloud-Based Applications

  2017cites this paper
• From Obfuscation to the Security of Fiat-Shamir for Proofs

  2017cites this paper
• Non-interactive delegation and batch NP verification from standard computational assumptions

  2017cites this paper
• Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness

  2017cites this paper
• Breaking the Sub-Exponential Barrier in Obfustopia

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

  2016cites this paper
• Another Look at Tightness II: Practical Issues in Cryptography

  2016cites this paper
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

  2016cites this paper
• Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security

  2016cites this paper
• Non-Interactive RAM and Batch NP Delegation from any PIR

  2016cites this paper
• Privacy-preserving efficient searchable encryption

  2016cites this paper
• Advances in Cryptology – CRYPTO 2016

  2016cites this paper
• The Magic of ELFs

  2016cites this paper
• The Moral Character of Cryptographic Work

  2015cites this paper
• Ad Hoc Broadcast, Trace, and Revoke Plus Time-Space Trade-Offs for Attribute-Based Encryption

  year unknowncites this paper
• WashU Scholarly Repository WashU Scholarly Repository

  year unknowncites this paper