Sciweavers

757 search results - page 46 / 152
» How secure are secure interdomain routing protocols
Sort
View
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
14 years 8 months ago
Secure multi-party quantum computation
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
Claude Crépeau, Daniel Gottesman, Adam Smit...
ICECCS
2005
IEEE
136views Hardware» more  ICECCS 2005»
14 years 1 months ago
Model-Based Design and Analysis of Permission-Based Security
To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems’ resources. These permissions rely on certai...
Jan Jürjens, Markus Lehrhuber, Guido Wimmel
ICCCN
2007
IEEE
14 years 2 months ago
Safeguarding Mutable Fields in AODV Route Discovery Process
— Assuring cryptographic integrity of mutable fields in any on-demand ad hoc routing protocol is more challenging than that of non mutable fields. We propose an efficient auth...
Kulasekaran A. Sivakumar, Mahalingam Ramkumar
WPES
2006
ACM
14 years 1 months ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle
RFIDSEC
2010
13 years 6 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...