Hierarchy for classes of garbling schemes

DOI10.1556/012.2015.52.2.1315zbMATH Open1355.94070OpenAlexW2128330375MaRDI QIDQ2820752FDOQ2820752

Authors: Tommi Meskanen, Valtteri Niemi, Noora Nieminen 

Publication date: 9 September 2016

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/012.2015.52.2.1315

Recommendations

• Adaptive security of practical garbling schemes
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Reactive garbling: foundation, instantiation, application
• Adaptively secure garbled circuits from one-way functions
• Adaptively secure garbling with near optimal online complexity

zbMATH Keywords

adaptive securitysecure multiparty computationsreusable garbled circuitsgarbling schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (5)

• Some applications of Gabai's internal hierarchy
• Reactive garbling: foundation, instantiation, application
• Garbling scheme for formulas with constant size of garbled gates
• Partial garbling schemes and their applications
• On treewidth, separators and Yao's garbling

This page was built for publication: Hierarchy for classes of garbling schemes

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