Sciweavers

109 search results - page 9 / 22
» Interactive unawareness revisited
Sort
View
CRYPTO
2009
Springer
111views Cryptology» more  CRYPTO 2009»
14 years 1 months ago
The Round Complexity of Verifiable Secret Sharing Revisited
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pand...
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 3 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
SIGIR
2010
ACM
14 years 1 months ago
Human performance and retrieval precision revisited
Several studies have found that the Cranfield approach to evaluation can report significant performance differences between retrieval systems for which little to no performance...
Mark D. Smucker, Chandra Prakash Jethani
ECAI
2006
Springer
14 years 1 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
WOTE
2010
13 years 7 months ago
Anonymity in Voting Revisited
According to international law, anonymity of the voter is a fundamental precondition for democratic elections. In electronic voting, several aspects of voter anonymity have been id...
Hugo Jonker, Wolter Pieters