Cryptography in constant parallel time

DOI10.1007/978-3-642-17367-7zbMath1298.94001OpenAlexW1603472107MaRDI QIDQ625101

Benny Applebaum

Publication date: 14 February 2011

Published in: Information Security and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17367-7

zbMATH Keywords

cryptographypseudorandom generatordigital signatureone-way functionsymmetric encryptionpublic key encryptionzero-knowledge proofclass \(N{C^0}\) circuitcollision resistant hash functioncommitment schememessage authentication schemeparallel time-complexity

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

Related Items (14)

Expander-based cryptography meets natural proofs ⋮ Statistical Randomized Encodings: A Complexity Theoretic View ⋮ Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization ⋮ Locally computable UOWHF with linear shrinkage ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ On actively-secure elementary MPC reductions ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings ⋮ Expander-Based Cryptography Meets Natural Proofs ⋮ Updatable signatures and message authentication codes ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ Fine-Grained Cryptography ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ The complexity of estimating min-entropy

This page was built for publication: Cryptography in constant parallel time