3115 search results - page 230 / 623 » Synthesizing Secure Protocols |
132
click to vote
ESORICS
2003
Springer
15 years 10 months ago
2003
Springer
Recently, David Chaum proposed an electronic voting scheme that combines visual cryptography and digital processing. It was designed to meet not only mathematical security standard...
186
click to vote
IACR
2011
14 years 5 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
137
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
199
click to vote
TCC
2007
Springer
15 years 11 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
164
Voted
CRYPTO
1987
Springer
15 years 9 months ago
1987
Springer
Many distributed systems manage some form of long-lived data, such as files or data bases. The performance and fault-tolerance of such systems may be enhanced if the repositories ...