Iranian Society of Cryptology
The ISC International Journal of Information Security
2008-2045
2008-3076
7
2
2015
07
01
Computationally secure multiple secret sharing: models, schemes, and formal security analysis
91
99
EN
S.
Mashhadi
Department of Mathematics, Iran University of Science & Technology, Tehran, Iran.
smashhadi@iust.ac.ir
10.22042/isecure.2016.7.2.2
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secure, or do not have a formal security analysis/proof. In 2013, Herranz <em>et al</em>. provided the first formal definition of computational security for multi-stage secret sharing scheme (MSSS) in the standard model and proposed a practical and secure scheme. As far as we know, their scheme is the only computationally secure MSS in the standard model, and there is no formal definition of the computational security for other categories of MSSs. Based on this motivation, in this paper, we define the first formal model of indistinguishability against the chosen secret attacks (CSA) for other types of MSSs in the standard model. Furthermore, we present two practical CSA-secure MSSs, belonging to different types of MSSs and enjoying the advantage of short shares. They are also provably secure in the standard model. Based on the semantic security of the underlying encryption schemes, we prove the security of our schemes.
Multi-secret Sharing Scheme,Multi-stage Secret Sharing Scheme,Provable Security,Private-key Cryptosystem,Standard Model
http://www.isecure-journal.com/article_39208.html
http://www.isecure-journal.com/article_39208_5d5a73550a70ea5d6bb13549b652a583.pdf
Iranian Society of Cryptology
The ISC International Journal of Information Security
2008-2045
2008-3076
7
2
2015
09
02
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
101
114
EN
B.
Rashidi
Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran
b.rashidi@ec.iut.ac.ir
R.
Rezaeian Farashahi
Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran
farashahi@cc.iut.ac.ir
S. M.
Sayedi
School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
m_sayedi@cc.iut.ac.ir
10.22042/isecure.2016.7.2.3
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2<sup>m</sup>) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The parallel computation provides regular and low-cost structure with low critical path delay. In addition, the pipelining technique is applied to the proposed structures to shorten the critical path and to perform the computation in two clock cycles. The implementations of the proposed methods over the binary extension fields GF (2<sup>163</sup>) and GF (2<sup>233</sup>) have been successfully verified and synthesized using Xilinx ISE 11 by Virtex-4, XC4VLX200 FPGA.
Bit-parallel Multiplier,Elliptic Curve Cryptography,Trinomials,Pentanomials,pipelining
http://www.isecure-journal.com/article_39209.html
http://www.isecure-journal.com/article_39209_81c33c86c4f60accd6de5e48d763c95f.pdf
Iranian Society of Cryptology
The ISC International Journal of Information Security
2008-2045
2008-3076
7
2
2015
10
29
EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
115
126
EN
R.
Ebrahimi Atani
Department of Computer Engineering, University of Guilan, Rasht, Iran.
rebrahimi@guilan.ac.ir
Sh.
Ebrahimi Atani
Department of Mathematics, University of Guilan, Rasht, Iran.
ebrahimiatani@gmail.com
A.
Hassani Karbasi
School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran.
amirhassanikarbasi@gmail.com
10.22042/isecure.2016.7.2.4
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ<sub>3</sub>] where ζ3 is a primitive cube root of unity. EEH applies representations of polynomials to the GGH encryption scheme and we discuss its key size and parameters selection. We also provide theoretical and experimental data to compare the security and efficiency of EEH to GGH with comparable parameter sets and show that EEH is an improvement over GGH in terms of security and efficiency.
Lattice-based Cryptography,Public-key Cryptosystem,GGH,Dedekind Domain,Polynomial Representation
http://www.isecure-journal.com/article_39210.html
http://www.isecure-journal.com/article_39210_0e8227907fad5648294ca716ba50db58.pdf
Iranian Society of Cryptology
The ISC International Journal of Information Security
2008-2045
2008-3076
7
2
2015
11
16
Cryptanalysis of some first round CAESAR candidates
127
134
EN
J.
Alizadeh
Faculty and Research Center of Communication and Information Technology, Imam Hossein University, Tehran, Iran.
alizadja@gmail.com
M. R.
Aref
Information Systems and Security Lab (ISSL), Sharif University of Technology, Tehran, Iran.
aref@sharif.edu
N.
Bagheri
The Electrical Engineering Department of Shahid Rajaee Teachers Training University, Tehran, Iran.
nbagheri@srttu.edu
H.
Sadeghi
Department of Mathematics, Faculty of Science, University of Qom, Qom, Iran.
sadeghihassan64@gmail.com
10.22042/isecure.2016.7.2.5
ΑΕS _ CMCCv₁, ΑVΑLΑNCHEv₁, CLΟCv₁, and SILCv₁ are four candidates of the first round of CAESAR. CLΟCv₁ is presented in FSE 2014 and SILCv₁ is designed upon it with the aim of optimizing the hardware implementation cost. In this paper, structural weaknesses of these candidates are studied. We present distinguishing attacks against ΑES _ CMCCv₁ with the complexity of two queries and the success probability of almost 1, and distinguishing attacks on CLΟCv₁ and SILCv₁ with the complexity of <em>Ο </em>(<em>2<sup>n/2</sup></em>) queries and the success probability of 0.63, in which <em>n</em> is bit length of message blocks. In addition, a forgery attack is presented against ΑVΑLΑNCHEv₁ which requires only one query and has the success probability of 1. The attacks reveal weaknesses in the structure of these first round candidates and inaccuracy of their security claims.
Authenticated Encryption,CAESAR,ΑES _ CMCCv₁,ΑVΑLΑNCHEv₁,CLΟCv₁,SILCv₁,Distinguishing Attack,Forgery Attack
http://www.isecure-journal.com/article_39211.html
http://www.isecure-journal.com/article_39211_3b3184008270f50d09c43257f9f95c19.pdf
Iranian Society of Cryptology
The ISC International Journal of Information Security
2008-2045
2008-3076
7
2
2015
10
16
Enhancing privacy of recent authentication schemes for low-cost RFID systems
135
149
EN
K.
Baghery
Information Systems and Security Lab (ISSL), Sharif University of Technology, Tehran, Iran.
baghery.karim@yahoo.com
B.
Abdolmaleki
Information Systems and Security Lab (ISSL), Sharif University of Technology, Tehran, Iran.
abdolmaleki.behzad@yahoo.com
B.
Akhbari
Faculty of Electrical Engineering, K. N. Toosi University of Technology, Tehran, Iran
akhbari@eetd.kntu.ac.ir
M. R.
Aref
ISSL Lab, Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
aref@sharif.edu
10.22042/isecure.2016.7.2.6
Nowadays Radio Frequency Identification (RFID) systems have appeared in lots of identification and authentication applications. In some sensitive applications, providing secure and confidential communication is very important for end-users. To this aim, different RFID authentication protocols have been proposed, which have tried to provide security and privacy of RFID users. In this paper, we analyze the privacy of two recently proposed RFID authentication protocols in 2012 and 2013. We present several traceability attacks including traceability, backward traceability and forward traceability against the first protocol. We also show that, the second protocol not only suffers from Denial-of-Service (DoS) attack, but also it is vulnerable to traceability and backward traceability attacks. We present our privacy analysis based on a well-known formal RFID privacy model which has been proposed by <em>Ouafi</em> and <em>Phan</em> in 2008. Then, in order to overcome the weaknesses, we apply some modifications on these protocols and propose two modified versions.
RFID Authentication Protocol,Security,Privacy,EPC C1 G2 Standard
http://www.isecure-journal.com/article_39212.html
http://www.isecure-journal.com/article_39212_bd0bcfa447e511b0b23c9facd074c1bb.pdf
Iranian Society of Cryptology
The ISC International Journal of Information Security
2008-2045
2008-3076
7
2
2015
12
07
A collusion mitigation scheme for reputation systems
151
166
EN
M.
Niknafs
Data and Network Security Lab. (DNSL), Department of Computer Engineering, Sharif University of Technology, Azadi Ave.,
Tehran, I.R. Iran
m.niknafs@vru.ac.ir
S.
Dorri Nogoorani
0000-0001-7406-112X
Data and Network Security Lab. (DNSL), Department of Computer Engineering, Sharif University of Technology, Azadi Ave.,
Tehran, I.R. Iran
dorri@modares.ac.ir
R.
Jalili
Data and Network Security Lab. (DNSL), Department of Computer Engineering, Sharif University of Technology, Azadi Ave.,
Tehran, I.R. Iran
jalili@sharif.edu
10.22042/isecure.2016.7.2.7
Reputation management systems are in wide-spread use to regulate collaborations in cooperative systems. Collusion is one of the most destructive malicious behaviors in which colluders seek to affect a reputation management system in an unfair manner. Many reputation systems are vulnerable to collusion, and some model-specific mitigation methods are proposed to combat collusion. Detection of colluders is shown to be an NP-complete problem. In this paper, we propose the <em>Colluders Similarity Measure</em> (CSM) which is used by a heuristic clustering algorithm (the <em>Colluders Detection Algorithm</em> (CDA)) to detect colluders in <em>O</em> (<em>n<sup>2</sup>m + n<sup>4</sup></em>) in which <em>m</em> and <em>n</em> are the total number of nodes and colluders, respectively. Furthermore, we propose an architecture to implement the algorithm in a distributed manner which can be used together with compatible reputation management systems. Implementation results and comparison with other mitigation methods show that our scheme prevents colluders from unfairly increasing their reputation and decreasing the reputation of the other nodes.
Attack resistance,Collusion,Reputation,Trust
http://www.isecure-journal.com/article_39213.html
http://www.isecure-journal.com/article_39213_f299d818f2716a4fdd1f2f770189e3ca.pdf
Iranian Society of Cryptology
The ISC International Journal of Information Security
2008-2045
2008-3076
7
2
2015
07
29
Persian Abstract
167
172
EN
10.22042/isecure.2015.7.2.8
Persian Abstract
http://www.isecure-journal.com/article_45228.html
http://www.isecure-journal.com/article_45228_a451759f6685be3e2ec87f36cd19a70c.pdf