Cryptographic Assumptions: A Position Paper
From MaRDI portal
Publication:2796139
DOI10.1007/978-3-662-49096-9_21zbMath1388.94056OpenAlexW2294626749WikidataQ57568014 ScholiaQ57568014MaRDI QIDQ2796139
Yael Tauman Kalai, Shafi Goldwasser
Publication date: 23 March 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_21
Related Items
MuSig2: simple two-round Schnorr multi-signatures ⋮ Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound ⋮ Permuted puzzles and cryptographic hardness ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ A formal security analysis of the Signal messaging protocol ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ Breaking the Sub-Exponential Barrier in Obfustopia
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- On the limits of nonapproximability of lattice problems
- The hunting of the SNARK
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Secure Two-Party Computation with Low Communication
- Succinct Randomized Encodings and their Applications
- Cryptanalysis of the Multilinear Map over the Integers
- The random oracle methodology, revisited
- Randomness and Computation
- Reconstructing RSA Private Keys from Random Key Bits
- Algorithms for Black-Box Fields and their Application to Cryptography
- Succinct NP Proofs from an Extractability Assumption
- Trapdoors for hard lattices and new cryptographic constructions
- On obfuscating point functions
- Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
- Efficient Public Key Encryption Based on Ideal Lattices
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology – CRYPTO 2004
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Protecting Obfuscation against Algebraic Attacks
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Classical hardness of learning with errors
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
