Efficient generation of shared RSA keys
From MaRDI portal
Publication:5441356
DOI10.1145/502090.502094zbMath1127.94340OpenAlexW2004765731WikidataQ57567971 ScholiaQ57567971MaRDI QIDQ5441356
Publication date: 11 February 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/502090.502094
Related Items (13)
Efficient set intersection with simulation-based security ⋮ Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Efficient and robust two-party RSA key generation ⋮ On the Security of Distributed Multiprime RSA ⋮ A Signature Scheme for a Dynamic Coalition Defence Environment Without Trusted Third Parties ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ New methods and abstractions for RSA-based forward secure signatures ⋮ Threshold undeniable signature scheme based on conic ⋮ A robust \((k,n)+1\) threshold proxy signature scheme based on factoring ⋮ Multiparty generation of an RSA modulus ⋮ Efficient, Robust and Constant-Round Distributed RSA Key Generation ⋮ A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem ⋮ Multiparty generation of an RSA modulus
This page was built for publication: Efficient generation of shared RSA keys
