Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Adaptively Secure Garbling with Near Optimal Online Complexity

Sanjam Garg, Akshayaram Srinivasan

Published Jan 1, 2018• 21 citations
Publisher
DOI
10.1007/978-3-319-78375-8_18

Related papers

Adaptive Security of Practical Garbling Schemes

Zahra Jafargholi, Sabine Oechsner

Lecture notes in computer science•Jan 1, 2020•11 citations

Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing

Mihir Bellare Y, Viet Tung Hoang, Phillip Rogaway

Lecture notes in computer science•Jan 1, 2012•118 citations

Adaptively Secure Garbling Schemes for Parallel Computations

Kai-Min Chung, Luowen Qian

Lecture notes in computer science•Jan 1, 2019•3 citations

Limits on the Adaptive Security of Yao’s Garbling

Chethan Kamath, Karen Klein, Krzysztof Pietrzak +1 more

Lecture notes in computer science•Jan 1, 2021•5 citations

Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits

Chaya Ganesh, Yashvanth Kondi, Arpita Patra +1 more

Lecture notes in computer science•Jan 1, 2018•17 citations

Adaptively Secure Garbled Circuits from One-Way Functions

Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky +2 more

Lecture notes in computer science•Jan 1, 2016•68 citations