Sciweavers

227 search results - page 30 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
ASIAN
2009
Springer
299views Algorithms» more  ASIAN 2009»
13 years 8 months ago
Deducibility Constraints
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
JCS
2011
156views more  JCS 2011»
13 years 2 months ago
Securing low-cost RFID systems: An unconditionally secure approach
We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authenticat...
Basel Alomair, Loukas Lazos, Radha Poovendran
DPD
2000
71views more  DPD 2000»
13 years 7 months ago
A Secure Agent-based Framework for Internet Trading in Mobile Computing Environments
Most of the current Internet trading frameworks, in particular their negotiation and payment phases, are intended for customers frequently connected to the Internet during an entir...
Xun Yi, Chee Kheong Siew, Xiao Feng Wang, Eiji Oka...
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
13 years 11 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
FSTTCS
2003
Springer
14 years 22 days ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh