6 search results - page 1 / 2 » Efficient Secure Linear Algebra in the Presence of Covert or... |
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
JOC
2010
12 years 11 months ago
2010
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...
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
ASIACRYPT
2001
Springer
13 years 8 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...