Sciweavers

1059 search results - page 60 / 212
» Modeling Security Protocols as Games
Sort
View
CCS
2008
ACM
13 years 12 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
ASIACRYPT
2009
Springer
14 years 4 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
IEEEHPCS
2010
13 years 8 months ago
Timed protocols insecurity problem is NP-complete
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
Massimo Benerecetti, Nicola Cuomo, Adriano Peron
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
MSWIM
2005
ACM
14 years 3 months ago
Application of synchronous dynamic encryption system in mobile wireless domains
Motivated by the tradeoff between security and efficiency performance parameters that has been imposed on all modern wireless security protocols, we designed a novel security syst...
Hamdy S. Soliman, Mohammed Omari