Adaptive security of Yao's garbled circuits

DOI10.1007/978-3-662-53641-4_17MaRDI QIDQ3179366zbMATH OpenOpenAlexFDO

Authors Zahra Jafargholi, Daniel Wichs

Publication date 21 December 2016

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53641-4_17

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Limits on the adaptive security of Yao's garbling
• Adaptive security of practical garbling schemes
• Adaptively secure garbled circuits from one-way functions
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Adaptively indistinguishable garbled circuits

Cites work

• A proof of security of Yao's protocol for two-party computation
• A quasipolynomial reduction for generalized selective decryption on trees
• Adaptive Security of Constrained PRFs
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Adaptively secure garbled circuits from one-way functions
• Encoding functions with constant online rate or how to compress garbled circuits keys
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Instantiating random oracles via UCEs

Cited in

(20)

• Adaptive security of practical garbling schemes
• Adaptively secure garbling schemes for parallel computations
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Sequential Circuit Design for Embedded Cryptographic Applications Resilient to Adversarial Faults
• On the exact round complexity of secure three-party computation
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• Be adaptive, avoid overcommitting
• Bounded Collusion ABE for TMs from IBE
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
• Compact NIZKs from standard assumptions on bilinear maps
• Depth-robust graphs and their cumulative memory complexity
• On treewidth, separators and Yao's garbling
• Threshold garbled circuits and ad hoc secure computation
• Limits on the adaptive security of Yao's garbling
• Compact NIZKs from standard assumptions on bilinear maps
• Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
• On the power of secure two-party computation
• The cost of adaptivity in security games on graphs
• Adaptively secure garbled circuits from one-way functions
• Security analysis and improvements for the IETF MLS standard for group messaging

This page was built for publication: Adaptive security of Yao's garbled circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179366)