Sciweavers

5484 search results - page 360 / 1097
» Almost-Everywhere Secure Computation
Sort
View
FOSSACS
2004
Springer
16 years 6 days ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...
MIDDLEWARE
2004
Springer
16 years 5 days ago
Exploring adaptability of secure group communication using formal prototyping techniques
Traditionally, adaptability in communication frameworks has been restricted to predefined choices without taking into consideration tradeoffs between them and the application req...
Sebastian Gutierrez-Nolasco, Nalini Venkatasubrama...
ACSAC
2000
IEEE
15 years 11 months ago
Personal Security Environment on Palm PDA
Digital signature schemes are based on the assumption that the signing key is kept in secret. Ensuring that this assumption holds is one of the most crucial problems for all curre...
Margus Freudenthal, S. Heiberg, Jan Willemson
CNSR
2010
IEEE
145views Communications» more  CNSR 2010»
15 years 10 months ago
Securing the Communications of Home Health Care Systems Based on RFID Sensor Networks
We address security solutions to protect the communication of the wireless components of a home health care system. We analyze especially the problem of exchanging secrets to sati...
Wiem Tounsi, Joaquín García-Alfaro, ...
ACISP
2004
Springer
15 years 10 months ago
Secure Bilinear Diffie-Hellman Bits
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been u...
Steven D. Galbraith, Herbie J. Hopkins, Igor Shpar...