Partial Garbling Schemes and Their Applications
From MaRDI portal
Publication:5167780
DOI10.1007/978-3-662-43948-7_54zbMath1410.68112OpenAlexW1720250315MaRDI QIDQ5167780
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_54
Related Items
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, Unbounded ABE via bilinear entropy expansion, revisited, Towards breaking the exponential barrier for general secret sharing, (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin, New ways to garble arithmetic circuits, Unbounded quadratic functional encryption and more from pairings, Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin, Adaptive Oblivious Transfer and Generalization, Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings, (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin, Functional encryption for computational hiding in prime order groups via pair encodings, Compact FE for unbounded attribute-weighted sums for logspace from SXDH, From private simultaneous messages to zero-information Arthur-Merlin protocols and back, Attribute-based multi-input FE (and more) for attribute-weighted sums, Succinct and adaptively secure ABE for ABP from \(k\)-Lin, Adaptively simulation-secure attribute-hiding predicate encryption, Improved inner-product encryption with adaptive security and full attribute-hiding, Optimal linear multiparty conditional disclosure of secrets protocols, Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations, Minimizing locality of one-way functions via semi-private randomized encodings, Leakage-resilient attribute based encryption in prime-order groups via predicate encodings, Unnamed Item, The communication complexity of private simultaneous messages, revisited, On the exact round complexity of secure three-party computation, Placing conditional disclosure of secrets in the communication complexity universe, Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \), Master-key KDM-secure ABE via predicate encoding, Functional encryption for attribute-weighted sums from \(k\)-Lin, Garbled Circuits as Randomized Encodings of Functions: a Primer
