scientific article

zbMath1141.94009MaRDI QIDQ3413440

Oded Goldreich

Publication date: 5 January 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitycryptographypseudorandom generatorone-way functionhashingsignature schemecomputational difficultyzero-knowledge proofsemantic securitymessage authentication schemeencryption schemepublic-keysecure protocolprivate-keymulti-party protocolhardcore predicategeneral cryptographic protocolindistinguishability of encryptionstrapdoor permutation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

Related Items (22)

A novel color image encryption algorithm based on spatial permutation and quantum chaotic map ⋮ A Framework for Adversarially Robust Streaming Algorithms ⋮ The function-inversion problem: barriers and opportunities ⋮ A secure authentication protocol for cholesteric spherical reflectors using homomorphic encryption ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Cryptography in constant parallel time ⋮ Indistinguishable predictions and multi-group fair learning ⋮ Universal reductions: reductions relative to stateful oracles ⋮ Secure multi-label data classification in cloud by additionally homomorphic encryption ⋮ Unclonable encryption, revisited ⋮ Generalized proofs of knowledge with fully dynamic setup ⋮ On the Complexity of Breaking Pseudoentropy ⋮ An RSA-Based (t,n) Threshold Proxy Signature Scheme without Any Trusted Combiner ⋮ Chasing Diagrams in Cryptography ⋮ Quantum attacks on pseudorandom generators ⋮ Can we resolve the continuum hypothesis? ⋮ Security of hedged Fiat-Shamir signatures under fault attacks ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ Algorithmic Information Theory and Foundations of Probability ⋮ Interactive and probabilistic proof-checking ⋮ A model-theoretic characterization of the weak pigeonhole principle ⋮ Towards efficient LPN-based symmetric encryption

This page was built for publication: