On the Cryptographic Complexity of the Worst Functions

DOI10.1007/978-3-642-54242-8_14zbMath1326.94072OpenAlexW2201666892MaRDI QIDQ5746343

Yuval Ishai, Eyal Kushilevitz, Amos Beimel, Ranjit Kumaresan

Publication date: 18 February 2014

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (26)

Secret-sharing schemes for very dense graphs ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Secure Computation with Minimal Interaction, Revisited ⋮ Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Private simultaneous messages based on quadratic residues ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Secure non-interactive reducibility is decidable ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ From private simultaneous messages to zero-information Arthur-Merlin protocols and back ⋮ Multi-party PSM, revisited: improved communication and unbalanced communication ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Unnamed Item ⋮ The communication complexity of private simultaneous messages, revisited ⋮ From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ A geometric approach to homomorphic secret sharing ⋮ Secret Sharing Schemes for Dense Forbidden Graphs ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Some Open Problems in Information-Theoretic Cryptography

This page was built for publication: On the Cryptographic Complexity of the Worst Functions