On unconditionally binding code-based commitment schemes
Citations
15 citations
Cites background or methods from "On unconditionally binding code-bas..."
...In [13, 24], the use of alternant Goppa codes in the McEliece cryptosystem and the classical Goppa codes in the Niederreiter cryptosystem are proposed....
[...]
...Alternative solutions proposed in [16, 23, 24] do not take into account the possibility of hacking a cryptosystem by the V....
[...]
...In [24], the construction of the McEliece and Niederreiter schemes based on the alternant Goppa codes is considered....
[...]
...In [16, 23, 24], the authors use quasi-cyclic low-density parity-check (QC-LDPC) codes [25] and maximum rank distance codes [16, 23] to build McEliece and Niederreiter cryptosystems, respectively....
[...]
4 citations
Cites background or methods from "On unconditionally binding code-bas..."
...53 milli Joules and the corresponding algorithm is RaCoSS [94]....
[...]
...In case of code based cryptography there are only two signature schemes pqsigRM [81] and RaCoSS [94], both of which require significant amount of energy for their algorithm execution....
[...]
1 citations
1 citations
Cites background from "On unconditionally binding code-bas..."
...In the view of V. Sidelnikov, the perspective direction is the use of algebra-geometric (built using curves, for example, elliptic, Fermat, Suzuki, Hermite, etc.) or cascading codes (Baldi et al., 2016; Cho et al., 2017; Dudikevich et al., 2010; Morozov et al., 2017; Sidelnikov, 2008)....
[...]
...…(Rao-Nama scheme) and non-symmetric McEliece and Niederreiter crypto-code systems is the high speed of cryptographic transmissions and the simultaneous securing of the confidentiality of data transmitted by open communication channels (Baldi et al., 2016; Morozov et al., 2017; Niederreiter, 1986)....
[...]
References
1,226 citations
781 citations
290 citations
"On unconditionally binding code-bas..." refers background in this paper
...Commitment schemes are one of the most essential building blocks for cryptographic primitives [5]....
[...]
124 citations
"On unconditionally binding code-bas..." refers background or methods in this paper
...In the work on code-based fully-simulatable oblivious transfer, David et al. [2] constructed an extractable commitment based on the Randomized McEliece PKE, but they only claimed computational binding....
[...]
...The xLPN-based JKPT scheme can be seen as the Randomized McEliece public-key encryption (PKE) by Nojima et al. [8], where the public key is replaced by a random code....
[...]
...The values kr and km such that k = kr + km, as well as tr and tm such that t = tr + tm are defined analogously to the above, in the same manner as in [8]....
[...]
...In this section, we follow the presentation of [8]....
[...]
...Our contributions are two-fold: (1) We present a “dual” version of the JKPT scheme based on the syndrome decoding problem, constructed in the spirit of the Randomized Niederreiter PKE by Nojima et al. [8]....
[...]
124 citations