Sciweavers

15 search results - page 2 / 3
» Rational secret sharing and multiparty computation: extended...
Sort
View
ESORICS
2010
Springer
13 years 5 months ago
Secure Multiparty Linear Programming Using Fixed-Point Arithmetic
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
Octavian Catrina, Sebastiaan de Hoogh
FC
2010
Springer
196views Cryptology» more  FC 2010»
13 years 6 months ago
Secure Computation with Fixed-Point Numbers
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...
Octavian Catrina, Amitabh Saxena
SACRYPT
2004
Springer
13 years 10 months ago
On Proactive Secret Sharing Schemes
Abstract. This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restri...
Ventzislav Nikov, Svetla Nikova
EUROCRYPT
2007
Springer
13 years 11 months ago
Non-interactive Proofs for Integer Multiplication
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
Ivan Damgård, Rune Thorbek
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 5 months ago
Communication and Round Efficient Information Checking Protocol
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
Arpita Patra, C. Pandu Rangan