Sciweavers

631 search results - page 120 / 127
» Intrusion-Resilient Secure Channels
Sort
View
LICS
1999
IEEE
15 years 4 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
MA
1999
Springer
155views Communications» more  MA 1999»
15 years 4 months ago
JGram: Rapid Development of Multi-Agent Pipelines for Real-World Tasks
Many real-world tasks can be decomposed into pipelines of sequential operations (where subtasks may themselves be composed of one or more pipelines). JGram is a framework enabling...
Rahul Sukthankar, Antoine Brusseau, Ray Pelletier,...
ESWS
2004
Springer
15 years 3 months ago
No Registration Needed: How to Use Declarative Policies and Negotiation to Access Sensitive Resources on the Semantic Web
Gaining access to sensitive resources on the Web usually involves an explicit registration step, where the client has to provide a predetermined set of information to the server. T...
Rita Gavriloaie, Wolfgang Nejdl, Daniel Olmedilla,...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
ESAS
2006
Springer
15 years 3 months ago
So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
Jolyon Clulow, Gerhard P. Hancke, Markus G. Kuhn, ...