621 search results - page 74 / 125 » Efficient Secure Multi-party Computation |
99
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
120
Voted
SCN
2008
Springer
15 years 16 days ago
2008
Springer
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
102
click to vote
ALT
2010
Springer
15 years 2 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
115
click to vote
CASES
2005
ACM
15 years 2 months ago
2005
ACM
Computer security becomes increasingly important with continual growth of the number of interconnected computing platforms. Moreover, as capabilities of embedded processors increa...
ESORICS
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. An oblivious signature with n keys (or messages) is a signature that the recipient can choose one of n keys (or messages) to get signed while the signer cannot find out o...