Sciweavers

227 search results - page 17 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 7 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
FC
2010
Springer
196views Cryptology» more  FC 2010»
13 years 8 months ago
Secure Computation with Fixed-Point Numbers
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
Octavian Catrina, Amitabh Saxena
INFOCOM
1997
IEEE
13 years 11 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
ACNS
2009
Springer
143views Cryptology» more  ACNS 2009»
14 years 2 months ago
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks
Abstract. We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, whi...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
SCN
2004
Springer
112views Communications» more  SCN 2004»
14 years 26 days ago
Controlling Spam by Secure Internet Content Selection
Unsolicited and undesirable e-mail (spam) is a growing problem for Internet users and service providers. We present the Secure Internet Content Selection (SICS) protocol, an effic...
Amir Herzberg