Sciweavers

2237 search results - page 106 / 448
» On the Security of Random Sources
Sort
View
118
Voted
HASE
2008
IEEE
15 years 11 months ago
A Few Remarks about Formal Development of Secure Systems
—Formal methods provide remarkable tools allowing for high levels of confidence in the correctness of developments. Their use is therefore encouraged, when not required, for the...
Éric Jaeger, Thérèse Hardin
CISS
2008
IEEE
15 years 11 months ago
Information theory based estimator of the number of sources in a sparse linear mixing model
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
Radu Balan
OOPSLA
2010
Springer
15 years 3 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
EUROCRYPT
2003
Springer
15 years 10 months ago
Why Provable Security Matters?
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
Jacques Stern
157
Voted
ATAL
2010
Springer
15 years 6 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...