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

Black-box constructions of bounded-concurrent secure computation

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

DOI10.1007/978-3-030-57990-6_5zbMath1506.94043OpenAlexW3013856896MaRDI QIDQ2106632

Omkant Pandey, Xiao Liang, Sanjam Garg, Ivan Visconti

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-57990-6_5


zbMATH Keywords

multi-party computationblack-box constructionbounded concurrent compositionstraight-line extraction


Mathematics Subject Classification ID

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


Related Items (3)

Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ On concurrent multi-party quantum computation




This page was built for publication: Black-box constructions of bounded-concurrent secure computation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2106632&oldid=14603434"
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 22:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki