Cryptography in $NC^0$
From MaRDI portal
Publication:5757454
DOI10.1137/S0097539705446950zbMath1126.94014MaRDI QIDQ5757454
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
Publication date: 7 September 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
cryptographycryptographic primitivespseudorandom generatorone-way functionconstant depth circuitsNC\(^0\)randomizing polynomials
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (52)
On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) ⋮ Expander-based cryptography meets natural proofs ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Statistical Randomized Encodings: A Complexity Theoretic View ⋮ Fine-grained secure computation ⋮ A dichotomy for local small-bias generators ⋮ Cryptographic hardness of random local functions. Survey ⋮ Local expanders ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization ⋮ Locally computable UOWHF with linear shrinkage ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Oblivious transfer with constant computational overhead ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ Algebraic Attacks against Random Local Functions and Their Countermeasures ⋮ From private simultaneous messages to zero-information Arthur-Merlin protocols and back ⋮ Additive randomized encodings and their applications ⋮ Unnamed Item ⋮ Cryptographic hardness under projections for time-bounded Kolmogorov complexity ⋮ Foundations of Homomorphic Secret Sharing ⋮ A Framework with Randomized Encoding for a Fast Privacy Preserving Calculation of Non-linear Kernels for Machine Learning Applications in Precision Medicine ⋮ Interleaved Group Products ⋮ Perfect Secure Computation in Two Rounds ⋮ Minimizing locality of one-way functions via semi-private randomized encodings ⋮ Incremental deterministic public-key encryption ⋮ Cryptography with Updates ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Unnamed Item ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Round-optimal secure multi-party computation ⋮ From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back ⋮ On the complexity of constructing pseudorandom functions (especially when they don't exist) ⋮ Fine-grained cryptography revisited ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ Key-dependent message security: generic amplification and completeness ⋮ On the power of secure two-party computation ⋮ Candidate One-Way Functions Based on Expander Graphs ⋮ A Candidate Counterexample to the Easy Cylinders Conjecture ⋮ Expander-Based Cryptography Meets Natural Proofs ⋮ On the One-Way Function Candidate Proposed by Goldreich ⋮ On the Power of Secure Two-Party Computation ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets ⋮ Cryptography with constant input locality ⋮ Unnamed Item
This page was built for publication: Cryptography in $NC^0$
