Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting

DOI10.1007/978-3-642-27954-6_20zbMath1292.94074OpenAlexW5294680MaRDI QIDQ2890015

Tal Rabin, Carmit Hazay, Tomas Toft, Gert Læssøe Mikkelsen

Publication date: 8 June 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27954-6_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Efficient set intersection with simulation-based security ⋮ Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ On the Security of Distributed Multiprime RSA ⋮ A Secure and Efficient Protocol for Electronic Treasury Auctions ⋮ Fast two-party signature for upgrading ECDSA to two-party scenario easily ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Scalable Multi-party Private Set-Intersection ⋮ What security can we achieve within 4 rounds? ⋮ A new construction of threshold cryptosystems based on RSA ⋮ Fast secure two-party ECDSA signing ⋮ Multiparty generation of an RSA modulus ⋮ Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security ⋮ Virtual Smart Cards: How to Sign with a Password and a Server ⋮ Encryption Switching Protocols ⋮ Multiparty generation of an RSA modulus

Cites Work

• Secure distributed key generation for discrete-log based cryptosystems
• Zero-knowledge proofs of identity
• Efficient signature generation by smart cards
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Robust threshold DSS signatures
• Robust and efficient sharing of RSA functions.
• Practical multi-candidate election system
• Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
• On the Amortized Complexity of Zero-Knowledge Protocols
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• On the Portability of Generalized Schnorr Proofs
• A public key cryptosystem and a signature scheme based on discrete logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Advances in Cryptology - CRYPTO 2003
• Efficient Two-Party Secure Computation on Committed Inputs
• Efficient generation of shared RSA keys
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting