Pages that link to "Item:Q3457081"

The following pages link to Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption (Q3457081):

Displaying 25 items.

• 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)
• A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
• Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
• Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
• Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin (Q2139632) (← links)
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions (Q2149832) (← links)
• Inner-product functional encryption with fine-grained access control (Q2691594) (← 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)
• Déjà Q: Encore! Un Petit IBE (Q2799097) (← links)
• Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
• Adaptive Oblivious Transfer and Generalization (Q2953778) (← 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)
• The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
• Verification protocol for stable matching from conditional disclosure of secrets (Q6547974) (← links)
• Improved polynomial secret-sharing schemes (Q6582181) (← links)
• Distributed broadcast encryption from bilinear groups (Q6604936) (← links)