135 search results - page 13 / 27 » Encompassing Attacks to Attacks in Abstract Argumentation Fr... |
143
click to vote
IMA
2009
Springer
16 years 17 days ago
2009
Springer
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
190
click to vote
ASIACRYPT
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
140
click to vote
PAM
2010
Springer
16 years 26 days ago
2010
Springer
Abstract. Timeouts play a fundamental role in network protocols, controlling numerous aspects of host behavior at different layers of the protocol stack. Previous work has documen...
168
click to vote
CISC
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
167
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...