Cryptographic assumptions: a position paper

DOI10.1007/978-3-662-49096-9_21MaRDI QIDQ2796139zbMATH OpenOpenAlexWikidataFDO

Authors 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Advances in Cryptology - CRYPTO 2003
• Adaptive One-Way Functions and Applications
• Limits of provable security from standard assumptions
• The Complexity of Public-Key Cryptography
• scientific article; zbMATH DE number 1722682

Cites work

• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• A method for obtaining digital signatures and public-key cryptosystems
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• Algorithms for black-box fields and their application to cryptography
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Classical hardness of learning with errors
• Cryptanalysis of the multilinear map over the integers
• Efficient public key encryption based on ideal lattices (extended abstract)
• Foundations of Cryptography
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 1088253 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• Indistinguishability obfuscation from semantically-secure multilinear encodings
• New directions in cryptography
• Noise-tolerant learning, the parity problem, and the statistical query model
• On lattices, learning with errors, random linear codes, and cryptography
• On obfuscating point functions
• On the limits of nonapproximability of lattice problems
• Probabilistic encryption
• Protecting obfuscation against algebraic attacks
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Public-key cryptosystems from the worst-case shortest vector problem
• Randomness and computation
• Reconstructing RSA Private Keys from Random Key Bits
• Secure two-party computation with low communication
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Succinct NP Proofs from an Extractability Assumption
• Succinct randomized encodings and their applications
• The hunting of the SNARK
• The random oracle methodology, revisited.
• Trapdoors for hard lattices and new cryptographic constructions
• Uniform direct product theorems: simplified, optimized, and derandomized
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

Cited in

(27)

• Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
• MuSig2: simple two-round Schnorr multi-signatures
• Permuted puzzles and cryptographic hardness
• A formal security analysis of the Signal messaging protocol
• The magic of ELFs
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• Somewhere statistical soundness, post-quantum security, and SNARGs
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• The Magic of ELFs
• Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
• Adaptive One-Way Functions and Applications
• Breaking the sub-exponential barrier in obfustopia
• Advances in Cryptology - CRYPTO 2003
• A “proof-reading” of Some Issues in Cryptography
• Robust transforming combiners from indistinguishability obfuscation to functional encryption
• Can PPAD hardness be based on standard cryptographic assumptions?
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
• Can PPAD hardness be based on standard cryptographic assumptions?
• Unified view for notions of bit security
• A public key identity-based revocation scheme: fully attribute-hiding and function private
• Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy
• Robust combiners and universal constructions for quantum cryptography
• Adversarially robust learning could leverage computational hardness.
• Bit security as cost to demonstrate advantage
• \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption
• The uber-knowledge assumption: a bridge to the AGM
• Boosting SNARKs and rate-1 barrier in arguments of knowledge

This page was built for publication: Cryptographic assumptions: a position paper

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796139)