Sciweavers

894 search results - page 125 / 179
» Secure Implementation of Channel Abstractions
Sort
View
SPC
2005
Springer
14 years 2 months ago
Supporting Dynamically Changing Authorizations in Pervasive Communication Systems
In pervasive computing environments, changes in context may trigger changes in an individual’s access permissions. We contend that existing access control frameworks do not provi...
Adam J. Lee, Jodie P. Boyer, Chris Drexelius, Pras...
EUROCRYPT
2009
Springer
14 years 9 months ago
A Leakage-Resilient Mode of Operation
A weak pseudorandom function (wPRF) is a cryptographic primitive similar to ? but weaker than ? a pseudorandom function: for wPRFs one only requires that the output is pseudorandom...
Krzysztof Pietrzak
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
14 years 3 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
LICS
1999
IEEE
14 years 1 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»
14 years 1 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,...