Sciweavers

1612 search results - page 127 / 323
» About models of security protocols
Sort
View
151
Voted
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
16 years 6 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
ASIACRYPT
2005
Springer
15 years 11 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
133
Voted
ENTCS
2006
138views more  ENTCS 2006»
15 years 5 months ago
Model Checking Russian Cards
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results. Key words: Crypto...
Hans P. van Ditmarsch, Wiebe van der Hoek, Ron van...
SPW
1999
Springer
15 years 9 months ago
Performance of Protocols
This paper presents a comprehensive study on the performance of common MANET (mobile ad hoc network) routing protocols under realistic network scenarios. The routing protocols use...
Michael Roe
PET
2012
Springer
13 years 8 months ago
Fault-Tolerant Privacy-Preserving Statistics
Real-time statistics on smart meter consumption data must preserve consumer privacy and tolerate smart meter failures. Existing protocols for this private distributed aggregation m...
Marek Jawurek, Florian Kerschbaum