1562 search results - page 47 / 313 » Mathematics, Cryptology, Security |
ACNS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
PKC
2010
Springer
15 years 1 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
CRYPTO
2008
Springer
15 years 1 months ago
2008
Springer
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. A secure failure-localization path-quality-monitoring (FLPQM) protocols allows a sender to localize faulty links on a single path through a network to a receiver, even wh...
107
click to vote
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This work presents a new privacy primitive called “Traceable Signatures”, together with an efficient provably secure implementation. To this end, we develop the unde...