default search action
Search dblp for Publications
export results for "toc:db/journals/isecure/isecure7.bht:"
@article{DBLP:journals/isecure/AlizadehABS15, author = {Javad Alizadeh and Mohammad Reza Aref and Nasour Bagheri and Hassan Sadeghi}, title = {Cryptanalysis of some first round {CAESAR} candidates}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {2}, pages = {127--134}, year = {2015}, url = {https://doi.org/10.22042/isecure.2016.7.2.5}, doi = {10.22042/ISECURE.2016.7.2.5}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/AlizadehABS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/AminiA15, author = {Morteza Amini and Majid Arasteh}, title = {A combination of semantic and attribute-based access control model for virtual organizations}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {1}, pages = {27--45}, year = {2015}, url = {https://doi.org/10.22042/isecure.2015.7.1.4}, doi = {10.22042/ISECURE.2015.7.1.4}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/AminiA15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/AtaniAK15, author = {Reza Ebrahimi Atani and Shahabaddin Ebrahimi Atani and Amir Hassani Karbasi}, title = {{EEH:} AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {2}, pages = {115--126}, year = {2015}, url = {https://doi.org/10.22042/isecure.2016.7.2.4}, doi = {10.22042/ISECURE.2016.7.2.4}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/AtaniAK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/BagheryAAA15, author = {Karim Baghery and Behzad Abdolmaleki and Bahareh Akhbari and Mohammad Reza Aref}, title = {Enhancing privacy of recent authentication schemes for low-cost {RFID} systems}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {2}, pages = {135--149}, year = {2015}, url = {https://doi.org/10.22042/isecure.2016.7.2.6}, doi = {10.22042/ISECURE.2016.7.2.6}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/isecure/BagheryAAA15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/FalavarjaniLG15, author = {Safieh Ghasemi Falavarjani and Behrouz Tork Ladani and Simin Ghasemi}, title = {{GGRA:} a grouped gossip-based reputation aggregation algorithm}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {1}, pages = {59--74}, year = {2015}, url = {https://doi.org/10.22042/isecure.2015.7.1.6}, doi = {10.22042/ISECURE.2015.7.1.6}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/FalavarjaniLG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/GanjaviAS15, author = {Ramin Ganjavi and Maryam Rajabzadeh Asaar and Mahmoud Salmasizadeh}, title = {A traceable optimistic fair exchange protocol in the standard model}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {1}, pages = {3--14}, year = {2015}, url = {https://doi.org/10.22042/isecure.2015.7.1.2}, doi = {10.22042/ISECURE.2015.7.1.2}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/GanjaviAS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/Jalili15, author = {Rasool Jalili}, title = {Editorial}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {1}, pages = {1--2}, year = {2015}, url = {https://doi.org/10.22042/isecure.2015.7.1.1}, doi = {10.22042/ISECURE.2015.7.1.1}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/Jalili15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/Jalili15a, author = {Rasool Jalili}, title = {Editorial}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {2}, pages = {89--90}, year = {2015}, url = {https://doi.org/10.22042/isecure.2016.7.2.1}, doi = {10.22042/ISECURE.2016.7.2.1}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/Jalili15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/Mashhadi15, author = {Samaneh Mashhadi}, title = {Computationally secure multiple secret sharing: models, schemes, and formal security analysis}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {2}, pages = {91--99}, year = {2015}, url = {https://doi.org/10.22042/isecure.2016.7.2.2}, doi = {10.22042/ISECURE.2016.7.2.2}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/Mashhadi15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/MortazaviJ15, author = {Reza Mortazavi and Saeed Jalili}, title = {A novel local search method for microaggregation}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {1}, pages = {15--26}, year = {2015}, url = {https://doi.org/10.22042/isecure.2015.7.1.3}, doi = {10.22042/ISECURE.2015.7.1.3}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/MortazaviJ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/NiknafsNJ15, author = {Mina Niknafs and Sadegh Dorri Nogoorani and Rasool Jalili}, title = {A collusion mitigation scheme for reputation systems}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {2}, pages = {151--166}, year = {2015}, url = {https://doi.org/10.22042/isecure.2016.7.2.7}, doi = {10.22042/ISECURE.2016.7.2.7}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/isecure/NiknafsNJ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/RashidiFS15, author = {Bahram Rashidi and Reza Rezaeian Farashahi and Sayed Masoud Sayedi}, title = {Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {2}, pages = {101--114}, year = {2015}, url = {https://doi.org/10.22042/isecure.2016.7.2.3}, doi = {10.22042/ISECURE.2016.7.2.3}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/RashidiFS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/SadeghiKR15, author = {Faramarz Sadeghi and Fatemeh Zarisfi Kermani and M. Kuchaki Rafsanjani}, title = {Optimizing image steganography by combining the {GA} and {ICA}}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {1}, pages = {47--58}, year = {2015}, url = {https://doi.org/10.22042/isecure.2015.7.1.5}, doi = {10.22042/ISECURE.2015.7.1.5}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/SadeghiKR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isecure/Vosoughi015, author = {Mehrshad Vosoughi and Ali Jahanian}, title = {Security-aware register placement to hinder malicious hardware updating and improve Trojan detectability}, journal = {{ISC} Int. J. Inf. Secur.}, volume = {7}, number = {1}, pages = {75--81}, year = {2015}, url = {https://doi.org/10.22042/isecure.2015.7.1.7}, doi = {10.22042/ISECURE.2015.7.1.7}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isecure/Vosoughi015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.