In this paper we propose a decentralized privacy-preserving system which is able to share sensible data in a way, that only predefined subsets of authorized entities can recover the data after getting an additional alarm message. The protocol uses two main communication channels: a P2P network where the encrypted information is stored, and a smaller private P2P network, which consists of the authorized parties called friend-to-friend network. We describe the communication protocol fulfilling the desired security requirements. The proposed protocol achieves unconditional security. The main cryptographic building blocks of the protocol are symmetric encryption schemes and secret sharing schemes.
In a series of papers Mauduit and Sárközy (partly with coauthors) studied finite pseudorandom binary sequences and they constructed
sequences with strong pseudorandom properties. In these constructions fields with prime order were used. In this paper a new
construction is presented, which is based on finite fields of order 2k.
The modified method of estimation of the resistance of block ciphers to truncated byte differential attack is proposed. The previously known method estimate the truncated byte differential probability for Rijndael-like ciphers. In this paper we spread the sphere of application of that method on wider class of ciphers. The proposed method based on searching the most probable truncated byte differential characteristics and verification of sufficient conditions of effective byte differentials absence.
In a series of papers Mauduit and Sárközy introduced measures of pseudorandomness and they constructed large families of sequences
with strong pseudorandom properties. In later papers the structure of families of binary sequences was also studied. In these
constructions fields with prime order were used. Throughout this paper the structure of a family of binary sequences based
on GF(2k) will be studied.
Authors:Mihály Bárász, Péter Ligeti, László Mérai and Dániel Nagy
Sealed bid auctions are a popular means of high-stakes bidding, as they eliminate the temporal element from the auction process,
allowing participants to take less emotional, more thoughtful decisions. In this paper, we propose a digital communication
protocol for conducting sealed bid auctions with high stakes, where the anonymity of bids as well as other aspects of fairness
must be protected.
The Dining Cryptographers’ Protocol (denoted by DC) was presented by David Chaum in 1988. The protocol allows the participants
to broadcast a message anonymously. In a recent paper (Another Twist in the Dining Cryptographers’ Protocol, submitted to
the Journal of Cryptology) the authors propose a variant of the original DC eliminating its main disadvantages.
In this paper we present a cryptographic protocol realizing anonymous sealed bid auctions, such as first price or Vickrey
auction, based on this variant. The proposed scheme allows to identify at least one dishonest participant violating the protocol
without using of Trusted Third Parties. Additionally, we require that bids are binding. It is achieved by enabling all participants
acting in concert (the so-called “angry mob”) to find out the identity of the winner, in case the winner fails to make the
New multivariate cryptosystems are introduced. Sequences f(n) of bijective polynomial transformations of bijective multivariate transformations of affine spaces Kn, n = 2, 3, ... , where K is a finite commutative ring with special properties, are used for the constructions of cryptosystems. On axiomatic level, the concept of a family of multivariate maps with invertible decomposition is proposed. Such decomposition is used as private key in a public key infrastructure. Requirements of polynomiality of degree and density allow to estimate the complexity of encryption procedure for a public user. The concepts of stable family and family of increasing order are motivated by studies of discrete logarithm problem in Cremona group. Statement on the existence of families of multivariate maps of polynomial degree and polynomial density with the invertible decomposition is formulated. We observe known explicit constructions of special families of multivariate maps. They correspond to explicit constructions of families of nonlinear algebraic graphs of increasing girth which appeared in Extremal Graph Theory. The families are generated by pseudorandom walks on graphs. This fact ensures the existence of invertible decomposition; a certain girth property guarantees the increase of order for the family of multivariate maps, good expansion properties of families of graphs lead to good mixing properties of graph based private key algorithms. We describe the general schemes of cryptographic applications of such families (public key infrastructure, symbolic Diffie—Hellman protocol, functional versions of El Gamal algorithm).
Authors:Eduardo Ruiz Duarte and Octavio Páez Osuna
We present an efficient endomorphism for the Jacobian of a curve C of genus 2 for divisors having a Non disjoint support. This extends the work of Costello and Lauter in  who calculated explicit formulæ for divisor doubling and addition of divisors with disjoint support in JF(C) using only base field operations. Explicit formulæ is presented for this third case and a different approach for divisor doubling.
In this paper we look at the security of two block ciphers which were both claimed in the published literature to be secure
against differential crypt-analysis (DC). However, a more careful examination shows that none of these ciphers is very secure
against... differential cryptanalysis, in particular if we consider attacks with sets of differentials. For both these ciphers
we report new perfectly periodic (iterative) aggregated differential attacks which propagate with quite high probabilities.
The first cipher we look at is GOST, a well-known Russian government encryption standard. The second cipher we look at is
PP-1, a very recent Polish block cipher. Both ciphers were designed to withstand linear and differential cryptanalysis. Unhappily,
both ciphers are shown to be much weaker than expected against advanced differential attacks. For GOST, we report better and
stronger sets of differentials than the best currently known attacks presented at SAC 2000  and propose the first attack
ever able to distinguish 16 rounds of GOST from random permutation. For PP-1 we show that in spite of the fact, that its S-box
has an optimal theoretical security level against differential cryptanalysis , , our differentials are strong enough
to allow to break all the known versions of the PP-1 cipher.