Sciweavers

80 search results - page 10 / 16
» Zero-knowledge from secure multiparty computation
Sort
View
JOC
2010
123views more  JOC 2010»
13 years 5 months ago
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
Yonatan Aumann, Yehuda Lindell
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
DIM
2006
ACM
14 years 4 months ago
Privacy preserving multi-factor authentication with biometrics
An emerging approach to the problem of reducing the identity theft is represented by the adoption of biometric authentication systems. Such systems however present however several...
Abhilasha Bhargav-Spantzel, Anna Cinzia Squicciari...
EUROCRYPT
2000
Springer
14 years 2 months ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver
CONCUR
2010
Springer
13 years 11 months ago
Session Types for Access and Information Flow Control
We consider a calculus for multiparty sessions with delegation, enriched with security levels for session participants and data. We propose a type system that guarantees both sessi...
Sara Capecchi, Ilaria Castellani, Mariangiola Deza...