31 search results - page 5 / 7 » Secure Arithmetic Computation with No Honest Majority |
EUROCRYPT
2007
Springer
13 years 12 months ago
2007
Springer
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
ICDE
2005
IEEE
14 years 7 months ago
2005
IEEE
Standard multi-party computation models assume semi-honest behavior, where the majority of participants implement protocols according to specification, an assumption not always pl...
ARITH
1999
IEEE
13 years 10 months ago
1999
IEEE
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
JOC
2007
13 years 5 months ago
2007
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...