Sciweavers

2436 search results - page 347 / 488
» Comonadic Notions of Computation
Sort
View
CHES
2009
Springer
140views Cryptology» more  CHES 2009»
16 years 5 months ago
On Tamper-Resistance from a Theoretical Viewpoint
Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defea...
Paulo Mateus, Serge Vaudenay
PKC
2009
Springer
240views Cryptology» more  PKC 2009»
16 years 5 months ago
Distributed Public-Key Cryptography from Weak Secrets
Abstract.We introduce the notion of distributed password-based publickey cryptography, where a virtual high-entropy private key is implicitly dened as a concatenation of low-entrop...
Céline Chevalier, David Pointcheval, Michel...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 4 months ago
Stochastic processes and temporal data mining
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...
Paul Cotofrei, Kilian Stoffel
CADE
2006
Springer
16 years 4 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
16 years 4 months ago
Strict polynomial-time in simulation and extraction
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
Boaz Barak, Yehuda Lindell