On the Cryptographic Complexity of the Worst Functions
From MaRDI portal
Recommendations
- Complexity theoretic aspects of some cryptographic functions
- Complexity theoretic lower bounds on cryptographic functions.
- scientific article; zbMATH DE number 1866861
- Computer Aided Systems Theory – EUROCAST 2005
- Toward basing fully homomorphic encryption on worst-case hardness
- scientific article; zbMATH DE number 503190
- Kolmogorov complexity and cryptography
- On hardness of one-way functions
- On expected polynomial runtime in cryptography
Cited in
(42)- 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
- Towards breaking the exponential barrier for general secret sharing
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- Optimal linear multiparty conditional disclosure of secrets protocols
- Placing conditional disclosure of secrets in the communication complexity universe
- A geometric approach to homomorphic secret sharing
- Zero-communication reductions
- Secure non-interactive simulation: feasibility and rate
- Secure non-interactive reduction and spectral analysis of correlations
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Multi-party PSM, revisited: improved communication and unbalanced communication
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- Secret sharing schemes for dense forbidden graphs
- Secret-sharing schemes for very dense graphs
- Secure computation with minimal interaction, revisited
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- Garbled circuits as randomized encodings of functions: a primer
- Placing conditional disclosure of secrets in the communication complexity universe
- Some open problems in information-theoretic cryptography
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- The communication complexity of private simultaneous messages, revisited
- 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
- Succinct computational secret sharing
- Cryptography from planted graphs: security with logarithmic-size messages
- Improved polynomial secret-sharing schemes
- Explicit lower bounds for communication complexity of PSM for concrete functions
- Exponential correlated randomness is necessary in communication-optimal perfectly secure two-party computation
- Efficient multiparty private simultaneous messages for symmetric functions
- Secret-sharing schemes for high slices
- New upper bounds for evolving secret sharing via infinite branching programs
- A note on low-communication secure multiparty computation via circuit depth-reduction
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- Cryptography with weak privacy
- Card-based protocols imply PSM protocols
- On the definition of malicious private information retrieval
- On the communication complexity of PSM and CDS for symmetric functions
This page was built for publication: On the Cryptographic Complexity of the Worst Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746343)
