The Experts below are selected from a list of 122607 Experts worldwide ranked by ideXlab platform
Matthieu Finiasz - One of the best experts on this subject based on the ideXlab platform.
-
EUROCRYPT - A public key encryption scheme based on the polynomial Reconstruction Problem
Lecture Notes in Computer Science, 2003Co-Authors: Daniel Augot, Matthieu FiniaszAbstract:The Polynomial Reconstruction Problem (PR) has been introduced in 1999 as a new hard Problem. Several cryptographic primitives established on this Problem have been constructed, for instance Naor and Pinkas have proposed a protocol for oblivious polynomial evaluation. Then it has been studied from the point of view of robustness, and several important properties have been discovered and proved by Kiayias and Yung. Furthermore the same authors constructed a symmetric cipher based on the PR Problem. In the present paper, we use the published security results and construct a new public key encryption scheme based on the hardness of the Problem of Polynomial Reconstruction. The scheme presented is the first public key encryption scheme based on this Polynomial Reconstruction Problem. We also present some attacks, discuss their performances and state the size of the parameters required to reach the desired security level. In conclusion, this leads to a cryptosystem where the cost of encryption and decryption per bit is low, and where the public key is kept relatively small.
-
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
2003Co-Authors: Daniel Augot, Matthieu FiniaszAbstract:The Polynomial Reconstruction Problem (PR) has been introduced in 1999 as a new hard Problem. Several cryptographic primitives established on this Problem have been constructed, for instance Naor and Pinkas have proposed a protocol for oblivious polynomial evaluation. Then it has been studied from the point of view of robustness, and several important properties have been discovered and proved by Kiayias and Yung. Furthermore the same authors constructed a symmetric cipher based on the PR Problem. In the present paper, we use the published security results and construct a new public key encryption scheme based on the hardness of the Problem of Polynomial Reconstruction. The scheme presented is the first public key encryption scheme based on this Polynomial Reconstruction Problem. We also present some attacks, discuss their performances and state the size of the parameters required to reach the desired security level. In conclusion, this leads to a cryptosystem where the cost of encryption and decryption per bit is low, and where the public key is kept relatively small.
Daniel Augot - One of the best experts on this subject based on the ideXlab platform.
-
EUROCRYPT - A public key encryption scheme based on the polynomial Reconstruction Problem
Lecture Notes in Computer Science, 2003Co-Authors: Daniel Augot, Matthieu FiniaszAbstract:The Polynomial Reconstruction Problem (PR) has been introduced in 1999 as a new hard Problem. Several cryptographic primitives established on this Problem have been constructed, for instance Naor and Pinkas have proposed a protocol for oblivious polynomial evaluation. Then it has been studied from the point of view of robustness, and several important properties have been discovered and proved by Kiayias and Yung. Furthermore the same authors constructed a symmetric cipher based on the PR Problem. In the present paper, we use the published security results and construct a new public key encryption scheme based on the hardness of the Problem of Polynomial Reconstruction. The scheme presented is the first public key encryption scheme based on this Polynomial Reconstruction Problem. We also present some attacks, discuss their performances and state the size of the parameters required to reach the desired security level. In conclusion, this leads to a cryptosystem where the cost of encryption and decryption per bit is low, and where the public key is kept relatively small.
-
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
2003Co-Authors: Daniel Augot, Matthieu FiniaszAbstract:The Polynomial Reconstruction Problem (PR) has been introduced in 1999 as a new hard Problem. Several cryptographic primitives established on this Problem have been constructed, for instance Naor and Pinkas have proposed a protocol for oblivious polynomial evaluation. Then it has been studied from the point of view of robustness, and several important properties have been discovered and proved by Kiayias and Yung. Furthermore the same authors constructed a symmetric cipher based on the PR Problem. In the present paper, we use the published security results and construct a new public key encryption scheme based on the hardness of the Problem of Polynomial Reconstruction. The scheme presented is the first public key encryption scheme based on this Polynomial Reconstruction Problem. We also present some attacks, discuss their performances and state the size of the parameters required to reach the desired security level. In conclusion, this leads to a cryptosystem where the cost of encryption and decryption per bit is low, and where the public key is kept relatively small.
Mauro Sozio - One of the best experts on this subject based on the ideXlab platform.
-
fast hare a fast heuristic for single individual snp haplotype Reconstruction
Workshop on Algorithms in Bioinformatics, 2004Co-Authors: Alessandro Panconesi, Mauro SozioAbstract:We study the single individual SNP haplotype Reconstruction Problem. We introduce a simple heuristic and prove experimentally that is very fast and accurate. In particular, when compared with a dynamic programming of [8] it is much faster and also more accurate. We expect Fast Hare to be very useful in practical applications. We also introduce a combinatorial Problem related to the SNP haplotype Reconstruction Problem that we call Min Element Removal. We prove its NP-hardness in the gapless case and its O(log n)-approximability in the general case.
Jean-sébastien Coron - One of the best experts on this subject based on the ideXlab platform.
-
Public Key Cryptography - Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem
Public Key Cryptography – PKC 2004, 2004Co-Authors: Jean-sébastien CoronAbstract:We describe a cryptanalysis of a public-key encryption scheme based on the polynomial Reconstruction Problem, published at Eurocrypt 2003 by Augot and Finiasz. Given the public-key and a ciphertext, we recover the corresponding plaintext in polynomial time. Our technique is a variant of the Berlekamp-Welsh algorithm. We also describe a cryptanalysis of the reparation published by the authors on the IACR eprint archive, using a variant of the previous attack. Both attacks are practical as given the public-key and a ciphertext, one recovers the plaintext in a few minutes on a single PC.
-
Cryptanalysis of a public-key encryption scheme based on the polynomial Reconstruction Problem.
IACR Cryptology ePrint Archive, 2003Co-Authors: Jean-sébastien CoronAbstract:We describe a cryptanalysis of a public-key encryption scheme based on the polynomial Reconstruction Problem . Given the public-key and a ciphertext, we recover the corresponding plaintext in polynomial time. Therefore, the scheme is not one-way. Our technique is a variant of the Berlekamp-Welsh algorithm.
-
Cryptanalysis of the Repaired Public-key Encryption Scheme Based on the Polynomial Reconstruction Problem.
IACR Cryptology ePrint Archive, 2003Co-Authors: Jean-sébastien CoronAbstract:At Eurocrypt 2003, Augot and Finiasz proposed a new public-key encryption scheme based on the polynomial Reconstruction Problem [1]. The scheme was subsequently broken in [5], who showed that given the public-key and a ciphertext, one could recover the corresponding plaintext in polynomial time. Recently, Augot, Finiasz and Loidreau published on the IACR eprint archive a reparation [2] of the cryptosystem. The reparation is based on the trace operator, and is resistant against the previous attack. However, we describe a new cryptanalysis of the repaired scheme. Given the public-key and a ciphertext, we can still recover the corresponding plaintext in polynomial time. Our technique is a variant of the Berlekamp-Welsh algorithm, and works very well in practice, as for the proposed parameters, we recover the plaintext in less than 8 minutes on a single PC. Key-Words: Cryptanalysis, Augot and Finiasz cryptosystem, Polynomial Reconstruction Problem, Reed-Solomon codes.
Robert Cierniak - One of the best experts on this subject based on the ideXlab platform.
-
A Practical Statistical Approach to the Reconstruction Problem Using a Single Slice Rebinning Method
Journal of Artificial Intelligence and Soft Computing Research, 2020Co-Authors: Robert Cierniak, Piotr Pluta, Andrzej KaźmierczakAbstract:AbstractThe paper presented here describes a new practical approach to the Reconstruction Problem applied to 3D spiral x-ray tomography. The concept we propose is based on a continuous-to-continuous data model, and the Reconstruction Problem is formulated as a shift invariant system. This original Reconstruction method is formulated taking into consideration the statistical properties of signals obtained by the 3D geometry of a CT scanner. It belongs to the class of nutating Reconstruction methods and is based on the advanced single slice rebinning (ASSR) methodology. The concept shown here significantly improves the quality of the images obtained after Reconstruction and decreases the complexity of the Reconstruction Problem in comparison with other approaches. Computer simulations have been performed, which prove that the Reconstruction algorithm described here does indeed significantly outperforms conventional analytical methods in the quality of the images obtained.
-
ICAISC (1) - Parallel Realizations of the Iterative Statistical Reconstruction Algorithm for 3D Computed Tomography
Artificial Intelligence and Soft Computing, 2017Co-Authors: Robert Cierniak, Jarosław Bilski, Jacek Smolag, Piotr Pluta, Nimit ShahAbstract:The presented paper describes a parallel realization of an approach to the Reconstruction Problem for 3D spiral x-ray tomography. The Reconstruction Problem is formulated taking into consideration the statistical properties of signals obtained by x-ray CT and the analytical methodology of image processing. The concept shown here significantly accelerates calculations performed during iterative Reconstruction process in the formulated algorithm. Computer simulations have been performed which prove that the Reconstruction algorithm described here, does indeed significantly outperform conventional analytical methods in the quality of the images obtained.
-
a 2d approach to tomographic image Reconstruction using a hopfield type neural network
Artificial Intelligence in Medicine, 2008Co-Authors: Robert CierniakAbstract:Objective: In this paper a new approach to tomographic image Reconstruction from projections is developed and investigated. Method: To solve the Reconstruction Problem a special neural network which resembles a Hopfield net is proposed. The Reconstruction process is performed during the minimizing of the energy function in this network. To improve the performance of the Reconstruction process an entropy term is incorporated into energy expression. Result and conclusion: The approach presented in this paper significantly decreases the complexity of the Reconstruction Problem.