Adaptively secure garbling with near optimal online complexity

DOI10.1007/978-3-319-78375-8_18zbMath1428.94073OpenAlexW2795149599MaRDI QIDQ1648850

Sanjam Garg, Akshayaram Srinivasan

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_18

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (13)

Limits on the adaptive security of Yao's garbling ⋮ A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Adaptive security of practical garbling schemes ⋮ Adaptively secure garbling schemes for parallel computations ⋮ Efficient laconic cryptography from learning with errors ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Collusion-resistant functional encryption for RAMs ⋮ One-time programs from commodity hardware ⋮ On treewidth, separators and Yao's garbling ⋮ The cost of adaptivity in security games on graphs ⋮ New constructions of hinting PRGs, OWFs with encryption, and more

This page was built for publication: Adaptively secure garbling with near optimal online complexity