Sciweavers

52 search results - page 6 / 11
» On the Analysis of Cryptographic Assumptions in the Generic ...
Sort
View
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 11 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
WISA
2009
Springer
14 years 1 months ago
You Cannot Hide behind the Mask: Power Analysis on a Provably Secure S-Box Implementation
Power analysis has shown to be successful in breaking symmetric cryptographic algorithms implemented on low resource devices. Prompted by the breaking of many protected implementat...
J. Pan, J. I. den Hartog, Jiqiang Lu
SCN
2011
Springer
292views Communications» more  SCN 2011»
13 years 2 months ago
Synthesis of attack actions using model checking for the verification of security protocols
Model checking cryptographic protocols have evolved to a valuable method for discovering counterintuitive security flaws, which make possible for a hostile agent to subvert the go...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
ACNS
2010
Springer
185views Cryptology» more  ACNS 2010»
14 years 5 days ago
Adaptive Chosen-Message Side-Channel Attacks
Most side-channel attacks that have been published in the open literature assume known- or chosen-message adversarial scenarios. In this paper, we analyze the increase of the attac...
Nicolas Veyrat-Charvillon, François-Xavier ...
FC
2003
Springer
101views Cryptology» more  FC 2003»
14 years 18 days ago
Fully Private Auctions in a Constant Number of Rounds
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
Felix Brandt