Sciweavers

12673 search results - page 2161 / 2535
» Learning while designing
Sort
View
CADE
2011
Springer
14 years 6 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
CCECE
2011
IEEE
14 years 6 months ago
Towards a portable, memory-efficient test system for Conducted Energy Weapons
We present a readily portable, memory-efficient performance test system (PTS) for Tasers. The proposed PTS has been developped for the most widely used Conducted Energy Weapons (...
Peyman Rahmati, David Dawson, Andy Adler
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
14 years 6 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
14 years 6 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
COCOON
2011
Springer
14 years 6 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
« Prev « First page 2161 / 2535 Last » Next »