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

Equivocating Yao

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

DOI10.1145/3055399.3055495zbMath1369.68206OpenAlexW2626580035MaRDI QIDQ4977997

Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3055399.3055495


zbMATH Keywords

adaptive securitysecure computationgarbled circuits


Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)


Related Items

Two-round adaptively secure multiparty computation from standard assumptions ⋮ Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Adaptively secure computation for RAM programs ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Adaptive security of multi-party protocols, revisited ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ On the power of secure two-party computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ MPC with friends and foes



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