The Experts below are selected from a list of 13920 Experts worldwide ranked by ideXlab platform
Gregor Weihs - One of the best experts on this subject based on the ideXlab platform.
-
An experimental implementation of oblivious transfer in the noisy storage model.
Nature Communications, 2014Co-Authors: Chris Erven, Stephanie Wehner, Raymond Laflamme, Nikolay Gigov, Gregor WeihsAbstract:The oblivious transfer protocol is a Cryptographic Primitive used to create many different secure two-party schemes. Here, Erven et al. provide the first implementation of the oblivious transfer protocol using entangled photons, within the noisy storage model.
-
An experimental implementation of oblivious transfer in the noisy storage model
Nature Communications, 2014Co-Authors: Chris Erven, Stephanie Wehner, Raymond Laflamme, Nikolay Gigov, Gregor WeihsAbstract:Cryptography’s importance in our everyday lives continues to grow in our increasingly digital world. Oblivious transfer has long been a fundamental and important Cryptographic Primitive, as it is known that general two-party Cryptographic tasks can be built from this basic building block. Here we show the experimental implementation of a 1-2 random oblivious transfer protocol by performing measurements on polarization-entangled photon pairs in a modified entangled quantum key distribution system, followed by all of the necessary classical postprocessing including one-way error correction. We successfully exchange a 1,366 bit random oblivious transfer string in ~3 min and include a full security analysis under the noisy storage model, accounting for all experimental error rates and finite size effects. This demonstrates the feasibility of using today’s quantum technologies to implement secure two-party protocols. The oblivious transfer protocol is a Cryptographic Primitive used to create many different secure two-party schemes. Here, Erven et al . provide the first implementation of the oblivious transfer protocol using entangled photons, within the noisy storage model.
Serge Vaudenay - One of the best experts on this subject based on the ideXlab platform.
-
CARDIS - Multipurpose Cryptographic Primitive ARMADILLO3
Smart Card Research and Advanced Applications, 2013Co-Authors: Petr Susil, Serge VaudenayAbstract:This paper describes a new design of the multipurpose Cryptographic Primitive ARMADILLO3 and analyses its security. The ARMADILLO3 family is oriented on small hardware such as smart cards and RFID chips. The original design ARMADILLO and its variants were analyzed by Sepehrdad et al. at CARDIS'11, the recommended variant ARMADILLO2 was analyzed by Plasencia et al. at FSE'12 and by Abdelraheem et al. at ASIACRYPT'11. The ARMADILLO3 design takes the original approach of combining a substitution and a permutation layer. The new family ARMADILLO3 introduces a reduced-size substitution layer with 3 ×3 and 4 ×4 S-boxes, which covers the substitution layer from 25% to 100% of state bits, depending on the security requirements. We propose an instance ARMADILLO3-A1/4 with a pair of permutations and S-boxes applied on 25% of state bits at each stage.
-
multipurpose Cryptographic Primitive armadillo3
Smart Card Research and Advanced Application Conference, 2012Co-Authors: Petr Susil, Serge VaudenayAbstract:This paper describes a new design of the multipurpose Cryptographic Primitive ARMADILLO3 and analyses its security. The ARMADILLO3 family is oriented on small hardware such as smart cards and RFID chips. The original design ARMADILLO and its variants were analyzed by Sepehrdad et al. at CARDIS'11, the recommended variant ARMADILLO2 was analyzed by Plasencia et al. at FSE'12 and by Abdelraheem et al. at ASIACRYPT'11. The ARMADILLO3 design takes the original approach of combining a substitution and a permutation layer. The new family ARMADILLO3 introduces a reduced-size substitution layer with 3 ×3 and 4 ×4 S-boxes, which covers the substitution layer from 25% to 100% of state bits, depending on the security requirements. We propose an instance ARMADILLO3-A1/4 with a pair of permutations and S-boxes applied on 25% of state bits at each stage.
-
Fast Key Recovery Attack on ARMADILLO1 and Variants
2011Co-Authors: Pouyan Sepehrdad, Petr Susil, Serge VaudenayAbstract:The ARMADILLO Cryptographic Primitive is a multi-purpose Cryptographic Primitive for RFID devices proposed at CHES’10. The main purpose of the Primitive is to provide a secure authentication in a challenge-response protocol. It has two versions, named ARMADILLO (subsequently denoted by ARMADILLO1) and ARMADILLO2. However, we found a fatal weakness in the design which allows a passive attacker to recover the secret key in polynomial time, of ARMADILLO1 and some generalizations. We introduce some intermediate designs which try to prevent the attack and link ARMADILLO1 to ARMADILLO2. Considering the fact that the attack against ARMADILLO1 is polynomial, this brings about some concerns into the security of the second version ARMADILLO2, although it remains unbroken so far.
-
ARMADILLO: A multi-purpose Cryptographic Primitive dedicated to hardware
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010Co-Authors: Stéphane Badel, Nilay Daǧtekin, Jorge Nakahara, Khaled Ouafi, Nicolas Reffé, Pouyan Sepehrdad, Petr Susil, Serge VaudenayAbstract:This paper describes and analyzes the security of a general-purpose Cryptographic function design, with application in RFID tags and sensor networks. Based on these analyzes, we suggest minimum parameter values for the main components of this Cryptographic function, called ARMADILLO. With fully serial architecture we obtain that 2 923 GE could perform one compression function computation within 176 clock cycles, consuming 44 μW at 1 MHz clock frequency. This could either authenticate a peer or hash 48 bits, or encrypt 128 bits on RFID tags. A better tradeoff would use 4 030 GE, 77 μW of power and 44 cycles for the same, to hash (resp. encrypt) at a rate of 1.1 Mbps (resp. 2.9 Mbps). As other tradeoffs are proposed, we show that ARMADILLO offers competitive performances for hashing relative to a fair Figure Of Merit (FOM).
-
on the use of gf inversion as a Cryptographic Primitive
Lecture Notes in Computer Science, 2004Co-Authors: Kazumaro Aoki, Serge VaudenayAbstract:Inversion in Galois Fields is a famous Primitive permutation for designing Cryptographic algorithms e.g. for Rijndael because it has suitable differential and linear properties. Inputs and outputs are usually transformed by addition (e.g. XOR) to key bits. We call this construction the APA (Add-Permute-Add) scheme. In this paper we study its pseudorandomness in terms of k-wise independence. We show that the pairwise independence of the APA construction is related to the impossible differentials properties. We notice that inversion has many impossible differentials, so x → 1 x+a + b is not pairwise independent. In 1998, Vaudenay proposed the random harmonic permutation h: x → a/x-b + c. Although it is not perfectly 3-wise independent (despite what was originally claimed), we demonstrate in this paper that it is almost 3-wise independent. In particular we show that any distinguisher limited to three queries between this permutation and a perfect one has an advantage limited to 3/q where q is the field order. This holds even if the distinguisher has access to h -1 . Finally, we investigate 4-wise independence and we suggest the cross-ratio as a new tool for cryptanalysis of designs involving inversion.
Chris Erven - One of the best experts on this subject based on the ideXlab platform.
-
An experimental implementation of oblivious transfer in the noisy storage model.
Nature Communications, 2014Co-Authors: Chris Erven, Stephanie Wehner, Raymond Laflamme, Nikolay Gigov, Gregor WeihsAbstract:The oblivious transfer protocol is a Cryptographic Primitive used to create many different secure two-party schemes. Here, Erven et al. provide the first implementation of the oblivious transfer protocol using entangled photons, within the noisy storage model.
-
An experimental implementation of oblivious transfer in the noisy storage model
Nature Communications, 2014Co-Authors: Chris Erven, Stephanie Wehner, Raymond Laflamme, Nikolay Gigov, Gregor WeihsAbstract:Cryptography’s importance in our everyday lives continues to grow in our increasingly digital world. Oblivious transfer has long been a fundamental and important Cryptographic Primitive, as it is known that general two-party Cryptographic tasks can be built from this basic building block. Here we show the experimental implementation of a 1-2 random oblivious transfer protocol by performing measurements on polarization-entangled photon pairs in a modified entangled quantum key distribution system, followed by all of the necessary classical postprocessing including one-way error correction. We successfully exchange a 1,366 bit random oblivious transfer string in ~3 min and include a full security analysis under the noisy storage model, accounting for all experimental error rates and finite size effects. This demonstrates the feasibility of using today’s quantum technologies to implement secure two-party protocols. The oblivious transfer protocol is a Cryptographic Primitive used to create many different secure two-party schemes. Here, Erven et al . provide the first implementation of the oblivious transfer protocol using entangled photons, within the noisy storage model.
Ye Zhen - One of the best experts on this subject based on the ideXlab platform.
-
An identity-based signcryption scheme with public verifiability
Journal of Computer Applications, 2007Co-Authors: Ye ZhenAbstract:Signcryption is a new Cryptographic Primitive, which can sign and encrypt message at the same time and reduce much communication and computation costs. A new efficient identity-based signcryption scheme was proposed, in which some characteristics of bilinear map were taken into account. In this scheme, anyone can identify the source of the ciphertext, but only the receiver can recover the plaintext. What's more, this scheme can satisfy the confidentiality, unforgeability and nonrepudiation required by signcryption. This scheme is also very efficient regarding the computation costs and the communication overheads after analyzing and being compared with other schemes.
Nikolay Gigov - One of the best experts on this subject based on the ideXlab platform.
-
An experimental implementation of oblivious transfer in the noisy storage model.
Nature Communications, 2014Co-Authors: Chris Erven, Stephanie Wehner, Raymond Laflamme, Nikolay Gigov, Gregor WeihsAbstract:The oblivious transfer protocol is a Cryptographic Primitive used to create many different secure two-party schemes. Here, Erven et al. provide the first implementation of the oblivious transfer protocol using entangled photons, within the noisy storage model.
-
An experimental implementation of oblivious transfer in the noisy storage model
Nature Communications, 2014Co-Authors: Chris Erven, Stephanie Wehner, Raymond Laflamme, Nikolay Gigov, Gregor WeihsAbstract:Cryptography’s importance in our everyday lives continues to grow in our increasingly digital world. Oblivious transfer has long been a fundamental and important Cryptographic Primitive, as it is known that general two-party Cryptographic tasks can be built from this basic building block. Here we show the experimental implementation of a 1-2 random oblivious transfer protocol by performing measurements on polarization-entangled photon pairs in a modified entangled quantum key distribution system, followed by all of the necessary classical postprocessing including one-way error correction. We successfully exchange a 1,366 bit random oblivious transfer string in ~3 min and include a full security analysis under the noisy storage model, accounting for all experimental error rates and finite size effects. This demonstrates the feasibility of using today’s quantum technologies to implement secure two-party protocols. The oblivious transfer protocol is a Cryptographic Primitive used to create many different secure two-party schemes. Here, Erven et al . provide the first implementation of the oblivious transfer protocol using entangled photons, within the noisy storage model.