Volume 12 (2020)
Volume 11 (2019)
Volume 10 (2018)
Volume 9 (2017)
Volume 8 (2016)
Volume 6 (2014)
Volume 5 (2013)
Volume 4 (2012)
Volume 3 (2011)
Volume 2 (2010)
Volume 1 (2009)
ORIGINAL RESEARCH PAPER
2. Computationally secure multiple secret sharing: models, schemes, and formal security analysis

S. Mashhadi

Volume 7, Issue 2 , Summer and Autumn 2015, Pages 91-99

http://dx.doi.org/10.22042/isecure.2016.7.2.2

Abstract
  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. ...  Read More

ORIGINAL RESEARCH PAPER
3. Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

B. Rashidi; R. Rezaeian Farashahi; S. M. Sayedi

Volume 7, Issue 2 , Summer and Autumn 2015, Pages 101-114

http://dx.doi.org/10.22042/isecure.2016.7.2.3

Abstract
  This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) 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. ...  Read More

ORIGINAL RESEARCH PAPER
4. EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

R. Ebrahimi Atani; Sh. Ebrahimi Atani; A. Hassani Karbasi

Volume 7, Issue 2 , Summer and Autumn 2015, Pages 115-126

http://dx.doi.org/10.22042/isecure.2016.7.2.4

Abstract
  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 ...  Read More

ORIGINAL RESEARCH PAPER
5. Cryptanalysis of some first round CAESAR candidates

J. Alizadeh; M. R. Aref; N. Bagheri; H. Sadeghi

Volume 7, Issue 2 , Summer and Autumn 2015, Pages 127-134

http://dx.doi.org/10.22042/isecure.2016.7.2.5

Abstract
  ΑΕ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 ...  Read More

ORIGINAL RESEARCH PAPER
6. Enhancing privacy of recent authentication schemes for low-cost RFID systems

K. Baghery; B. Abdolmaleki; B. Akhbari; M. R. Aref

Volume 7, Issue 2 , Summer and Autumn 2015, Pages 135-149

http://dx.doi.org/10.22042/isecure.2016.7.2.6

Abstract
  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 ...  Read More

ORIGINAL RESEARCH PAPER
7. A collusion mitigation scheme for reputation systems

M. Niknafs; S. Dorri Nogoorani; R. Jalili

Volume 7, Issue 2 , Summer and Autumn 2015, Pages 151-166

http://dx.doi.org/10.22042/isecure.2016.7.2.7

Abstract
  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, ...  Read More