scientific article; zbMATH DE number 1942435
From MaRDI portal
Publication:4409134
Recommendations
Cited in
(25)- Experimental performance of shared {RSA} modulus generation
- Oblivious sampling with applications to two-party k-means clustering
- Selected application of the Chinese remainder theorem in multiparty computation
- Efficient RSA key generation and threshold Paillier in the two-party setting
- List signature schemes
- Virtual smart cards: how to sign with a password and a server
- Efficient RSA key generation and threshold Paillier in the two-party setting
- On the security of distributed multiprime RSA
- A signature scheme for a dynamic coalition defence environment without trusted third parties
- Efficient secure two-party exponentiation
- Computing inverses over a shared secret modulus
- From Passive to Covert Security at Low Cost
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Accelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test
- Efficient Binary Conversion for Paillier Encrypted Values
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
- scientific article; zbMATH DE number 1950328 (Why is no real title available?)
- Efficient distributed computation modulo a shared secret
- Public Key Cryptography - PKC 2005
- Multiparty generation of an RSA modulus
- Multiparty generation of an RSA modulus
- A new approach to efficient and secure fixed-point computation
- Tiresias: large scale, UC-secure threshold Paillier
- Beyond the 1/2 bound: on the theory and practice of biprimality tests
- Spreading alerts quietly and the subgroup escape problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409134)
