Pages that link to "Item:Q5746343"

The following pages link to On the Cryptographic Complexity of the Worst Functions (Q5746343):

Displaying 23 items.

• Secret-sharing schemes for very dense graphs (Q290386) (← links)
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
• Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← links)
• Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
• From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
• Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
• Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
• A geometric approach to homomorphic secret sharing (Q2061949) (← links)
• Secure non-interactive simulation: feasibility and rate (Q2170112) (← links)
• Secure non-interactive reduction and spectral analysis of correlations (Q2170114) (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
• Multi-party PSM, revisited: improved communication and unbalanced communication (Q2697857) (← links)
• From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back (Q2799090) (← links)
• Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
• Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption (Q3457081) (← links)
• Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
• (Q5090374) (← links)
• Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
• Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
• Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
• The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
• Private simultaneous messages based on quadratic residues (Q6070349) (← links)