Food intake, serum biomarkers of folate, vitamins B6 and B12, polymorphism of gene...
A study on the number of zeros of a polynomial in the real line
| Full text | |
| Author(s): |
Cayrel, Pierre-Louis
;
Lindner, Richard
;
Rueckert, Markus
;
Silva, Rosemberg
;
Heng, SH
;
Kurosawa, K
Total Authors: 6
|
| Document type: | Journal article |
| Source: | Lecture Notes in Computer Science; v. 6402, p. 3-pg., 2010-01-01. |
| Abstract | |
Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any additional information that might be used by an impersonator. In this paper we propose a scheme whose security relies on the existence of a commitment scheme and on the hardness of worst-case lattice problems. We adapt a code-based identification scheme devised by Cayrel and Veron, which constitutes an improvement of Stern's construction. Our solution sports analogous improvements over the lattice adaption of Stern's scheme which Kawachi et al. presented at ASIACRYPT 2008. Specifically, due to a smaller cheating probability close to 1/2 and a similar communication cost, any desired level of security will be achieved in fewer rounds. Compared to Lyubashevsky's scheme presented at ASIACRYPT 2009, our proposal, like Kawachi's, offers a much milder security assumption: namely, the hardness of SIS for trinary solutions. The same assumption was used for the SWIFFT hash function, which is secure for much smaller parameters than those proposed by Lyubashevsky. (AU) | |
| FAPESP's process: | 08/07949-8 - Error-Correcting Codes and Lattice Applications to Public-Key Cryptography. |
| Grantee: | Rosemberg André da Silva |
| Support Opportunities: | Scholarships in Brazil - Doctorate |