Pages that link to "Item:Q5167780"

The following pages link to Partial Garbling Schemes and Their Applications (Q5167780):

Displaying 31 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)
• Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
• Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
• Partial covering arrays for data hiding and quantization (Q1669914) (← links)
• Functional encryption for computational hiding in prime order groups via pair encodings (Q1692153) (← links)
• From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
• Adaptively simulation-secure attribute-hiding predicate encryption (Q1710619) (← links)
• Improved inner-product encryption with adaptive security and full attribute-hiding (Q1710620) (← links)
• Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
• Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
• Leakage-resilient attribute based encryption in prime-order groups via predicate encodings (Q1752551) (← links)
• Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
• Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
• Master-key KDM-secure ABE via predicate encoding (Q2061934) (← links)
• Functional encryption for attribute-weighted sums from \(k\)-Lin (Q2096503) (← links)
• Succinct and adaptively secure ABE for ABP from \(k\)-Lin (Q2691593) (← links)
• Adaptive Oblivious Transfer and Generalization (Q2953778) (← links)
• Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings (Q2953790) (← links)
• Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
• (Q5090374) (← links)
• Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
• On the exact round complexity of secure three-party computation (Q5918099) (← links)
• The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
• (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin (Q6041293) (← links)
• (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
• Compact FE for unbounded attribute-weighted sums for logspace from SXDH (Q6135395) (← links)
• Registered ABE via predicate encodings (Q6604925) (← links)
• Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH} (Q6618631) (← links)
• Registered attribute-based signature (Q6635748) (← links)
• Toward malicious constant-rate 2PC via arithmetic garbling (Q6637552) (← links)