860 search results - page 88 / 172 » Completeness in two-party secure computation: a computationa... |
146
click to vote
ICSOC
2007
Springer
16 years 12 days ago
2007
Springer
Abstract. In this paper, we present the mechanisms needed for Byzantine fault tolerant coordination of Web services atomic transactions. The mechanisms have been incorporated into ...
153
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
The timely and accurate detection of computer and network system intrusions has always been an elusive goal for system administrators and information security researchers. Existin...
161
click to vote
ASIACRYPT
2010
Springer
15 years 4 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 ...
141
click to vote
ISI
2007
Springer
16 years 12 days ago
2007
Springer
: We view the task of sensemaking in intelligence as that of abducing a story whose plot explains the current data and makes verifiable predictions about the future and the past. W...
155
click to vote
FOCS
2007
IEEE
16 years 18 days ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...