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

Fast distributed RSA key generation for semi-honest and malicious adversaries

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

DOI10.1007/978-3-319-96881-0_12zbMath1436.94061OpenAlexW2884593066MaRDI QIDQ1784098

Valery Osheter, Benny Pinkas, Yehuda Lindell, Tore Kasper Frederiksen

Publication date: 26 September 2018

Full work available at URL: https://eprint.iacr.org/2018/577.pdf



Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (7)

Multi-party revocation in sovrin: performance through distributed trust ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ How to verifiably encrypt many bits for an election? ⋮ What security can we achieve within 4 rounds? ⋮ Multiparty generation of an RSA modulus ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Multiparty generation of an RSA modulus




This page was built for publication: Fast distributed RSA key generation for semi-honest and malicious adversaries

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