One-time signature scheme from syndrome decoding over generic error-correcting codes
| Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
|---|---|
| Data(s) |
18/10/2012
18/10/2012
2011
|
| Resumo |
We describe a one-time signature scheme based on the hardness of the syndrome decoding problem, and prove it secure in the random oracle model. Our proposal can be instantiated on general linear error correcting codes, rather than restricted families like alternant codes for which a decoding trapdoor is known to exist. (C) 2010 Elsevier Inc. All rights reserved, Brazilian National Council for Scientific and Technological Development (CNPq)[303163/2009-7] Research and Development Centre, Ericsson Telecomunicacoes S.A. (Brazil) |
| Identificador |
JOURNAL OF SYSTEMS AND SOFTWARE, v.84, n.2, p.198-204, 2011 0164-1212 http://producao.usp.br/handle/BDPI/18134 10.1016/j.jss.2010.09.016 |
| Idioma(s) |
eng |
| Publicador |
ELSEVIER SCIENCE INC |
| Relação |
Journal of Systems and Software |
| Direitos |
restrictedAccess Copyright ELSEVIER SCIENCE INC |
| Palavras-Chave | #Post-quantum cryptography #Digital signatures #Syndrome decoding problem #Computer Science, Software Engineering #Computer Science, Theory & Methods |
| Tipo |
article original article publishedVersion |
