Sciweavers

143 search results - page 20 / 29
» A Range Test Secure in the Active Adversary Model
Sort
View
DEON
2008
Springer
13 years 10 months ago
Specifying Intrusion Detection and Reaction Policies: An Application of Deontic Logic
The security policy of an information system may include a wide range of different requirements. The literature has primarily focused on access and information flow control require...
Nora Cuppens-Boulahia, Frédéric Cupp...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 9 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
SIGIR
2011
ACM
12 years 11 months ago
Learning to rank from a noisy crowd
We study how to best use crowdsourced relevance judgments learning to rank [1, 7]. We integrate two lines of prior work: unreliable crowd-based binary annotation for binary classi...
Abhimanu Kumar, Matthew Lease
INFOCOM
2006
IEEE
14 years 2 months ago
Detecting Stations Cheating on Backoff Rules in 802.11 Networks Using Sequential Analysis
— As the commercial success of the IEEE 802.11 protocol has made wireless infrastructure widely deployed, user organizations are increasingly concerned about the new vulnerabilit...
Yanxia Rong, Sang Kyu Lee, Hyeong-Ah Choi