90 search results - page 5 / 18 » Improved Primitives for Secure Multiparty Integer Computatio... |
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
FC
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
FC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
We construct two new multiparty digital signature schemes that allow multiple signers to sequentially produce a compact, fixed-length signature. First, we introduce a new primiti...