IACR Local Search

Possible queries include homomorphic author:david.
Found 20000 results
Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE
Eprint
https://eprint.iacr.org/2015/298
Yongge Wang
Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes. Though LLL reduction...
last revised 15 Jan 2016
Quantum Resistant Public Key Encryption Scheme RLCE and IND-CCA2 Security for McEliece Schemes
Eprint
https://eprint.iacr.org/2017/206
Yongge Wang
Recently, Wang (2016) introduced a random linear code based quantum resistant public key encryp- tion scheme RLCE which is a variant of McEliece encryption scheme. In this paper, we introduce a revised version of the RLCE...
last revised 24 Dec 2017
Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Scheme
Eprint
https://eprint.iacr.org/2017/733
Yongge Wang
This paper compares the efficiency of various algorithms for implementing public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained...
Recovering short secret keys of RLCE in polynomial time
Eprint
https://eprint.iacr.org/2018/528
Alain Couvreur Matthieu Lequesne Jean-Pierre Tillich
We present a key recovery attack against Y. Wang's Random Linear Code Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum cryptography. This attack recovers the secret key for all the short key...
Public Key Compression for Constrained Linear Signature Schemes
Eprint
https://eprint.iacr.org/2018/670
Ward Beullens Bart Preneel Alan Szepieniec
We formalize the notion of a constrained linear trapdoor as an abstract strategy for the generation of signature schemes, concrete instantiations of which can be found in MQ-based, code-based, and lattice-based cryptography....
An Encryption Scheme based on Random Split of St-Gen Codes
Eprint
https://eprint.iacr.org/2016/202
Simona Samardjiska Danilo Gligoroski
Staircase-Generator codes (St-Gen codes) have recently been introduced in the design of code-based public key schemes and for the design of steganographic matrix embedding schemes. In this paper we propose a method for random...
last revised 4 Mar 2016
New Reports in the Cryptology ePrint Archive
New Reports in the Cryptology ePrint Archive (The list contains reports posted since the last newsletter issue appeared.) 2004/330 ( PDF ) Multicollision Attacks on Generalized Hash Functions M. Nandi and D. R. Stinson...
New Reports in the Cryptology ePrint Archive
New Reports in the Cryptology ePrint Archive (The list contains reports posted since the last newsletter issue appeared.) 2002/159 ( PS PS.GZ PDF ) Key-Collision Attacks Against RMAC Tadayoshi Kohno 2002/158 ( PS PS.GZ ) The...
A Provably Secure Group Signature Scheme from Code-Based Assumptions
Eprint
https://eprint.iacr.org/2015/479
Martianus Frederic Ezerman Hyung Tae Lee San Ling Khoa Nguyen Huaxiong Wang
We solve an open question in code-based cryptography by introducing the first provably secure group signature scheme from code-based assumptions. Specifically, the scheme satisfies the CPA-anonymity and traceability...
last revised 5 Dec 2015
CRYPTO 2001: Accepted Papers
https://iacr.org/conferences/crypto2001/accept.html
Papers accepted to Crypto 2001 [In alphabetical order by title] A Chosen Ciphertext Attack On RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized In PKCS #1 James Manger An Efficient Scheme for Proving a Shuffle...
CRYPTO 2001: Accepted Papers
https://iacr.org/conferences/crypto2001/accepted.htm
Papers accepted to Crypto 2001 [In alphabetical order by title] A Chosen Ciphertext Attack On RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized In PKCS #1 James Manger An Efficient Scheme for Proving a Shuffle...
EUROCRYPT 2002: Amsterdam, The Netherlands
https://iacr.org/archive/eurocrypt2002/index.html
EUROCRYPT 2002: Amsterdam, The Netherlands Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project Lars R. Knudsen (Ed.): Advances in Cryptology - EUROCRYPT 2002, International...
EUROCRYPT 2002: Amsterdam, The Netherlands
https://iacr.org/archive/eurocrypt2002/eurocrypt2002.html
EUROCRYPT 2002: Amsterdam, The Netherlands Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project Lars R. Knudsen (Ed.): Advances in Cryptology - EUROCRYPT 2002, International...
New classes of public key cryptosystem K(XVI)SE(1)PKC constructed based on Reed-Solomon code over extension field of m=8 and K(XVI)SE(2)PKC, based on binary cyclic code.
Eprint
https://eprint.iacr.org/2015/714
Masao KASAHARA
In this paper, we first present a new class of code based public key cryptosystem(PKC) based on Reed-Solomon code over extension field of less than m=9, referred to as K(XVI)SE(1)PKC. We then present a new class of quadratic...
last revised 18 Jul 2015
Eurocrypt 2002 Program
https://iacr.org/conferences/eurocrypt2002/program.html
Amsterdam, April 28 - May 2, 2002 PROGRAM Sunday April 28, 2002 17:30-19:30 Registration 18:30-20:30 Reception Monday April 29, 2002 08:15 Registration 08:50-09:00 Welcome Session 1: Cryptanalysis I Chair: Bart Preneel...
Eurocrypt '99 Preliminary Technical Program
Eurocrypt '99 Preliminary Technical Program For more information, see the conference web page at http://www.iacr.org/conferences/ec99/index.html . Monday, 3.5.1999 Morning sessions Cryptanalysis I (chair: Jacques Stern)...
Eurocrypt '99 Preliminary Technical Program
Eurocrypt '99 Preliminary Technical Program For more information, see the conference web page at http://www.iacr.org/conferences/ec99/index.html . Monday, 3.5.1999 Morning sessions Cryptanalysis I (chair: Jacques Stern)...
Eurocrypt '99 Preliminary Technical Program
In this paper, we first show that three public-key $(k,n)$-traceability schemes can be derived from an $[n,u,d]$-linear code ${\cal C}$ such that $d \geq 2k+1$. The previous schemes are obtained as special cases. This...