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

Robust multiparty computation with faster verification time

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

DOI10.1007/978-3-319-93638-3_8zbMath1444.94095OpenAlexW2807714502MaRDI QIDQ1784445

Ananya Shrivastava, Souradyuti Paul

Publication date: 26 September 2018

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


zbMATH Keywords

fairnessrobustnessmulti-party computationblockchainEthereum


Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)


Related Items (1)

Game-Theoretic Analysis of an Incentivized Verifiable Computation System







This page was built for publication: Robust multiparty computation with faster verification time

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