Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among keys to circumvent security properties. Security against related-key attacks has been a subject of study in numerous recent cryptographic papers. However, most of these results are attacks on specific constructions, whi...

The complexity of voting procedures, and their variations from country to country, make it challenging to design a secure electronic voting system. In most of the usual proposals, the security of the system relies mainly on a blackbox voting machine. Meanwhile, the most advanced proposals base their security arguments on (complicated) cryptographic protocols, e.g. blind signatures or homomorphi...

Attacks on cryptographic systems are limited by the available computational resources. A theoretical understanding of these resource limitations is needed to evaluate the security of cryptographic primitives and procedures. This study uses an Attacker versus Environment game formalism based on computability logic to quantify Shannon’s work function and evaluate resource use in cryptanalysis. A ...

Computer security has become the main stream issue to protect the sensitive information in open networks. The complete secure system is hard to design these days due to vulnerabilities in firewalls, file and application servers, email servers, and Web servers. The solution to problems of computer security and privacy can be achieved by the cryptography mechanism. A popular way to implement secu...

The main result of this paper is that the Dolev-Yao model is a safe abstraction of the computational model for security protocols including those that combine asymmetric and symmetric encryption, signature and hashing. Moreover, message forwarding and private key transmission are allowed. To our knowledge this is the first result that deals with hash functions and the combination of these crypt...

This paper studies the properties and constructions of nonlinear Boolean functions, which are a core component of cryptographic primitives including data encryption algorithms and one-way hash functions. A main contribution of this paper is to completely characterise the structures of cryptographic functions that satisfy the propagation criterion with respect to all but six or less vectors.

Cache Timing Attacks have attracted a lot of cryptographic attention due to their relevance for the AES. However, their applicability to other cryptographic primitives is less well researched. In this talk, we give an overview over our analysis of the stream ciphers that were selected for phase 3 of the eStream project.

Most cryptographic primitives such as encryption, authentication or secret sharing require randomness. Usually one assumes that perfect randomness is available, but those primitives might also be realized under weaker assumptions. In this work we continue the study of building secure cryptographic primitives from imperfect random sources initiated by Dodis and Spencer (FOCS’02). Their main resu...

Abst rac t . We study a corpus of particular Boolean functions: the idempotents. They enable us to construct functions which achieve the best possible tradeoffs between the cryptographic fundamental properties: balancedness, correlation-immunity, a high degree and a high nonlinearity (that is a high distance from the affine functions). They all represent extremely secure cryptographic primitive...

Abstract Cryptanalysis is the development and study of attacks against cryptographic primitives protocols. Many properties rely on difficulty generating an adversary who, given object sampled from one two classes, correctly distinguishes class used to generate that object. In case cipher suite distinguishing problem, classes are different primitives. this paper, we propose a methodology based m...