562 search results - page 20 / 113 » Secure Multiparty Computation with General Interaction Patte... |
128
click to vote
CHI
2010
ACM
15 years 10 months ago
2010
ACM
Authentication in public spaces poses significant security risks. Most significantly, passwords can be stolen, potentially leading to fraud. A common method to steal a PIN is thro...
135
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
We perform a theoretical study of the following queryview security problem: given a view V to be published, does V logically disclose information about a confidential query S? The...
142
click to vote
IACR
2011
14 years 3 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
164
click to vote
IANDC
2007
15 years 3 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
132
click to vote
AGENTS
2000
Springer
15 years 8 months ago
2000
Springer
Conversations involving three or more agents often occur in multi-agent systems, for example in brokering and auction protocols typically used in e-commerce. For developing agents ...