Filters








38,542 Hits in 8.7 sec

Identity-Based Encryption from Codes with Rank Metric [chapter]

Philippe Gaborit, Adrien Hauteville, Duong Hieu Phan, Jean-Pierre Tillich
2017 Lecture Notes in Computer Science  
In this paper, we propose a new method, based on the hardness of learning problems with rank metric, to design the first code-based IBE scheme.  ...  We solve this problem by relying on codes with rank metric.  ...  This work has been supported in part by the French ANR projects ALAMBIC (ANR-16-CE39-0006) and ID-FIX (ANR-16-CE39-0004).  ... 
doi:10.1007/978-3-319-63697-9_7 fatcat:wscwpb53mnbq3gvupqhivibf6e

On the hardness of the decoding and the minimum distance problems for rank codes [article]

Gaborit Philippe, Zemor Gilles
2014 arXiv   pre-print
In this paper we give a randomized reduction for the Rank Syndrome Decoding problem and Rank Minimum Distance problem for rank codes.  ...  Our results are based on an embedding from linear codes equipped with Hamming distance unto linear codes over an extension field equipped with the rank metric.  ...  Koetter and Kschichang introduced in 2007 [27] the notion of subspace metric (which is a small variation on the rank metric [13] ), and the so-called Koetter-Kschichang codes which are an adaptation of  ... 
arXiv:1404.3482v1 fatcat:xt74dmiqlrfubilplovelx3ww4

RankSynd a PRNG Based on Rank Metric [chapter]

Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich
2016 Lecture Notes in Computer Science  
In this paper, we consider a pseudo-random generator based on the difficulty of the syndrome decoding problem for rank metric codes.  ...  We also study the resistance of this problem against a quantum computer.  ...  In particular, recent advances in this field have shown that the problem of decoding general codes in rank metric is hard [15] .  ... 
doi:10.1007/978-3-319-29360-8_2 fatcat:qhvb2d6ybjcojodofuk56sqdw4

RankSynd a PRNG Based on Rank Metric [article]

Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich
2016 arXiv   pre-print
In this paper, we consider a pseudo-random generator based on the difficulty of the syndrome decoding problem for rank metric codes.  ...  We also study the resistance of this problem against a quantum computer.  ...  Acknowledgment Jean-Pierre Tillich acknowledges the support of the Commission of the European Communities through the Horizon 2020 program under project number 645622 PQCRYPTO.  ... 
arXiv:1603.05128v1 fatcat:kfftjkzb3zexjo36iwmhaanjle

On the Computational Complexity of Blind Detection of Binary Linear Codes [article]

Alexios Balatsoukas-Stimming, Aris Filos-Ratsikas
2019 arXiv   pre-print
In this work, we study the computational complexity of the Minimum Distance Code Detection problem.  ...  In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which the sum of distances between the observations  ...  The work of Alexios Balatsoukas-Stimming is supported by the Swiss National Science Foundation project #175813.  ... 
arXiv:1806.01050v2 fatcat:oa3hcux2afgpzinejoqgj2fdtq

Technical Perspective: Program synthesis using stochastic techniques

Sumit Gulwani
2016 Communications of the ACM  
The impressive results of their implementation STOKE on hard program optimization benchmarks illustrate the promising potential of stochastic search to hard program synthesis problems.  ...  The first-phase cost metric is based on functional equivalence to the target input sequence (a Boolean constraint). The second-phase cost met-  ...  The impressive results of their implementation STOKE on hard program optimization benchmarks illustrate the promising potential of stochastic search to hard program synthesis problems.  ... 
doi:10.1145/2863699 fatcat:lm56mdetifegjix6chtui7wtuq

Revocable Identity-Based Encryption from Codes with Rank Metric [chapter]

Donghoon Chang, Amit Kumar Chauhan, Sandeep Kumar, Somitra Kumar Sanadhya
2018 Lecture Notes in Computer Science  
We prove that our revocable IBE scheme is selective-ID secure in the random oracle model, under the hardness of three problems: the Rank Syndrome Decoding (RSD) problem, the Augmented Low Rank Parity Check  ...  Our revocable IBE scheme from codes with rank metric makes use of a binary tree data structure to reduce the amount of work in terms of key updates for the key authority.  ...  Hard Problems for Rank-based Cryptography The security of code based cryptosystems generally relies on the hardness of syndrome decoding problem. We define the rank metric version of this problem.  ... 
doi:10.1007/978-3-319-76953-0_23 fatcat:feppnvzs4vh2dixqswhwlggcqa

A New Rank Metric Codes Based Encryption Scheme [chapter]

Pierre Loidreau
2017 Lecture Notes in Computer Science  
The idea of the design mixes two existing approaches designing rank metric based encryption schemes.  ...  We design a new McEliece-like rank metric based encryption scheme from Gabidulin codes. We explain why it is not affected by the invariant subspace attacks also known as Overbeck's attacks.  ...  Introduction The security of the main post-quantum (PQ) primitives relies on the difficulty of solving decoding problems in some metrics (Hamming metric for codes, Euclidean metric for lattices).  ... 
doi:10.1007/978-3-319-59879-6_1 fatcat:kqdhhgfszbfinpdfbdu24af6wy

Efficient Encryption from Random Quasi-Cyclic Codes [article]

Carlos Aguilar, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor
2016 arXiv   pre-print
The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based on the difficulty of decoding random linear codes from random errors of low weight.  ...  We also provide an analysis of the decryption failure probability of our scheme in the Hamming metric case: for the rank metric there is no decryption failure.  ...  Depending on the metric the above problem is instantiated with, we denote it either by SD for the Hamming metric or by Rank-SD (RSD) for the Rank metric.  ... 
arXiv:1612.05572v1 fatcat:up7iubangna3db2gd77tfi3ywe

Dual-Ouroboros: An improvement of the McNie scheme

Philippe Gaborit, ,University of Limoges, Limoges, France, Lucky Galvez, Adrien Hauteville, Jon-Lark Kim, Myeong Jae Kim, Young-Sik Kim, ,Sogang University, Seoul, South Korea, ,Chosun University, Gwangju, South Korea
2019 Advances in Mathematics of Communications  
In this paper, we present Dual-Ouroboros, an improvement of McNie, which can be seen as a dual version of the Ouroboros-R protocol [1], another candidate to the NIST competition.  ...  McNie [8] is a code-based public key encryption scheme submitted to the NIST Post-Quantum Cryptography standardization [10] as a candidate.  ...  Rank metric codes are codes defined in the classical way with the rank metric used. An interesting class of rank metric codes is defined as follows. Definition 2.2.  ... 
doi:10.3934/amc.2020021 fatcat:vnpz5ucgunaqbeawo4ngjdo77a

On the Complexity of the Rank Syndrome Decoding Problem

Philippe Gaborit, Olivier Ruatta, Julien Schrek
2016 IEEE Transactions on Information Theory  
Very recently a new cryptosystem based on Low Rank Parity Check code (LRPC), a rank equivalent of LDPC codes, was proposed in [26] .  ...  attack based on the error support in a rank metric context.  ...  The Gabidulin codes are the equivalent of the Reed-Solomon codes for rank metric. The main problem in the cryptosystem consists in finding a way to hide the decoding matrix.  ... 
doi:10.1109/tit.2015.2511786 fatcat:quynxesm5vfsvpwkfgdw73bfyi

Low Row Rank Parity Check Codes [article]

Ermes Franch, Chunlei Li
2021 arXiv   pre-print
It is shown that the extension indeed yields a superfamily of LRPC codes, which are termed low row rank parity check codes. The decoding method of the proposed codes is also investigated.  ...  In this paper we present an extended variant of low rank parity check matrix (LRPC) codes that have received significant interests in recent years.  ...  In 2013 Gaborit, Murat and Zémor introduced a new family of rank metric codes, termed low rank parity check (LRPC) codes, which can be seen as the equivalent of LDPC codes [7] .  ... 
arXiv:2104.08065v1 fatcat:w3yfghqy6vel5gyh3ubl5wtmqq

A code-based blind signature

Olivier Blazy, Philippe Gaborit, Julien Schrek, Nicolas Sendrier
2017 2017 IEEE International Symposium on Information Theory (ISIT)  
In this paper we give the first blind signature protocol for code-based cryptography.  ...  The security of our blind protocol is based on the security of a trapdoor function for the syndrome decoding problem: the CFS signature scheme for Hamming distance and on the more recent RankSign protocol  ...  Most of cryptographic protocols have equivalent counterparts in rank metric and in particular all the tools used for our blind signature scheme have equivalent counterparts in rank metric : a rank based  ... 
doi:10.1109/isit.2017.8007023 dblp:conf/isit/BlazyGSS17 fatcat:7xcox7uwc5cwdollffjadn2ara

LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding

Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
2021 Designs, Codes and Cryptography  
AbstractWe propose the new rank-metric code-based cryptosystem which is based on the hardness of list decoding and interleaved decoding of Gabidulin codes. is an improved variant of the Faure–Loidreau  ...  It is not based on hiding the structure of a code.  ...  Acknowledgements The work of J. Renner and A. Wachter-Zeh was supported by the European Research  ... 
doi:10.1007/s10623-021-00861-z fatcat:ugo3dwngfrb7rpnqwiuckzpe5i

LIGA: A Cryptosystem Based on the Hardness of Rank-Metric List and Interleaved Decoding [article]

Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
2020 arXiv   pre-print
We propose the new rank-metric code-based cryptosystem LIGA which is based on the hardness of list decoding and interleaved decoding of Gabidulin codes.  ...  It is not based on hiding the structure of a code.  ...  Further, we thank Pierre Loidreau for his valuable comments on a previous version of this  ... 
arXiv:1812.04892v2 fatcat:mz3o2goz3zdnno6dcfgcy2fuye
« Previous Showing results 1 — 15 out of 38,542 results