Cryptography in constant parallel time

DOI10.1007/978-3-642-17367-7MaRDI QIDQ625101zbMATH OpenOpenAlexFDO

Authors 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

cryptographyone-way functionsymmetric encryptiondigital signaturepublic key encryptionclass \(N{C^0}\) circuitcollision resistant hash functioncommitment schememessage authentication schemeparallel time-complexitypseudorandom generatorzero-knowledge proof

Mathematics Subject Classification ID

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

Recommendations

• Cryptography with constant input locality
• Cryptography with Constant Input Locality
• Complexity and Cryptography
• Complexity theory and cryptology. An introduction to cryptocomplexity.
• Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich
• Publication:4941849
• scientific article; zbMATH DE number 5081837
• Fine-grained cryptography revisited
• Cryptographic hardness of random local functions. Survey

Cited in

(22)

• Expander-Based Cryptography Meets Natural Proofs
• The complexity of estimating min-entropy
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• scientific article; zbMATH DE number 4049036 (Why is no real title available?)
• On actively-secure elementary MPC reductions
• Cryptography with Constant Input Locality
• On the relationship between statistical zero-knowledge and statistical randomized encodings
• On the relationship between statistical zero-knowledge and statistical randomized encodings
• Expander-based cryptography meets natural proofs
• Cryptographic hardness of random local functions -- survey
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
• Garbled circuits as randomized encodings of functions: a primer
• System-level non-interference of constant-time cryptography. I: Model
• Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
• Statistical randomized encodings: a complexity theoretic view
• Cryptography in $NC^0$
• Cryptographic hardness of random local functions. Survey
• Fine-Grained Cryptography
• Cryptography with constant input locality
• Updatable signatures and message authentication codes
• Locally computable UOWHF with linear shrinkage
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization

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

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