53 search results - page 2 / 11 » Minimal Complete Primitives for Secure Multi-party Computati... |
TCC
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
EUROCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
FC
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents computationally “lightweight” schemes for performing biometric authentication that carry out the comparison stage without revealing any information that can...
17
Voted
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
ISCA
2011
IEEE
12 years 8 months ago
2011
IEEE
High assurance systems used in avionics, medical implants, and cryptographic devices often rely on a small trusted base of hardware and software to manage the rest of the system. ...