Sciweavers

1059 search results - page 172 / 212
» Modeling Security Protocols as Games
Sort
View
ASIACRYPT
2009
Springer
14 years 4 months ago
A Framework for Universally Composable Non-committing Blind Signatures
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
Masayuki Abe, Miyako Ohkubo
JSAC
2010
138views more  JSAC 2010»
13 years 8 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
DBSEC
2007
106views Database» more  DBSEC 2007»
13 years 11 months ago
Enforcing Honesty in Assured Information Sharing Within a Distributed System
The growing number of distributed information systems such as the internet has created a need for security in data sharing. When several autonomous parties attempt to share data, t...
Ryan Layfield, Murat Kantarcioglu, Bhavani M. Thur...
SOFSEM
2010
Springer
14 years 6 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
IJNSEC
2007
144views more  IJNSEC 2007»
13 years 10 months ago
IPLess Stochastic Anonymous Routing Algorithm Using Multi-Agent Systems
The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is com...
Magdy Saeb, Meer Hamza, Ahmed El-Shikh