TY - GEN
T1 - Lossy identification schemes from decisional RSA
AU - Hasegawa, Shingo
AU - Isobe, Shuji
N1 - Publisher Copyright:
© 2014 IEICE.
PY - 2014/12/8
Y1 - 2014/12/8
N2 - Lossy identification schemes derive tightly secure signature schemes via the Fiat-Shamir transformation. There exist several instantiations of lossy identification schemes by using several cryptographic assumptions. In this paper, we propose a new construction of lossy identification scheme from the decisional RSA assumption which are introduced by Groth. Our lossy identification scheme has efficient response algorithm because it requires no modular exponentiation.
AB - Lossy identification schemes derive tightly secure signature schemes via the Fiat-Shamir transformation. There exist several instantiations of lossy identification schemes by using several cryptographic assumptions. In this paper, we propose a new construction of lossy identification scheme from the decisional RSA assumption which are introduced by Groth. Our lossy identification scheme has efficient response algorithm because it requires no modular exponentiation.
UR - http://www.scopus.com/inward/record.url?scp=84920522059&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84920522059&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84920522059
T3 - Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014
SP - 143
EP - 147
BT - Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 International Symposium on Information Theory and Its Applications, ISITA 2014
Y2 - 26 October 2014 through 29 October 2014
ER -