Sciweavers

13 search results - page 2 / 3
» Model of a true random number generator aimed at cryptograph...
Sort
View
FOSSACS
2005
Springer
13 years 10 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
12 years 25 days ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
SEC
2008
13 years 6 months ago
Hiding in Groups: On the Expressiveness of Privacy Distributions
Many applications inherently disclose information because perfect privacy protection is prohibitively expensive. RFID tags, for example, cannot be equipped with the cryptographic p...
Karsten Nohl, David Evans
GECCO
2010
Springer
184views Optimization» more  GECCO 2010»
13 years 8 months ago
A mono surrogate for multiobjective optimization
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 5 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson