Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Adaptively indistinguishable garbled circuits

From MaRDI portal
Publication:1690262
Jump to:navigation, search


DOI10.1007/978-3-319-70503-3_2zbMath1406.94067OpenAlexW2765275671MaRDI QIDQ1690262

Daniel Wichs, Zahra Jafargholi, Alessandra Scafuro

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_2


Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)


Related Items

Limits on the adaptive security of Yao's garbling, Succinct garbling schemes from functional encryption through a local simulation paradigm, FE and iO for Turing machines from minimal assumptions, Adaptive security of practical garbling schemes, Adaptively secure garbling schemes for parallel computations, A survey of lattice based expressive attribute based encryption, On treewidth, separators and Yao's garbling, On the power of secure two-party computation, Threshold garbled circuits and ad hoc secure computation



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1690262&oldid=14009844"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki