Sciweavers

2652 search results - page 467 / 531
» When Information Improves Information Security
Sort
View
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
16 years 17 days ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
OOPSLA
2007
Springer
16 years 16 days ago
OOMatch: pattern matching as dispatch in Java
We present a new language feature, specified as an extension to Java. The feature is a form of dispatch which includes and subsumes multimethods (see for example [3]), but which ...
Adam Richard, Ondrej Lhoták
IAT
2006
IEEE
16 years 14 days ago
Trust Negotiations with Customizable Anonymity
Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosin...
Anna Cinzia Squicciarini, Abhilasha Bhargav-Spantz...
ANCS
2006
ACM
16 years 11 days ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
FOSSACS
2005
Springer
15 years 12 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto