<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1665-6423</journal-id>
<journal-title><![CDATA[Journal of applied research and technology]]></journal-title>
<abbrev-journal-title><![CDATA[J. appl. res. technol]]></abbrev-journal-title>
<issn>1665-6423</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1665-64232015000100002</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Privacy-preserving security solution for cloud services]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Malina]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Hajny]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Dzurenda]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Zeman]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,university of technology brno Department od Telecommunications Brno University ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Czech Republic</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2015</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2015</year>
</pub-date>
<volume>13</volume>
<numero>1</numero>
<fpage>20</fpage>
<lpage>31</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232015000100002&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1665-64232015000100002&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1665-64232015000100002&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[We propose a novel privacy-preserving security solution for cloud services. Our solution is based on an efficient non-bilinear group signature scheme providing the anonymous access to cloud services and shared storage servers. The novel solution offers anonymous authenticationfor registered users. Thus, users' personal attributes (age, valid registration, successful payment) can be proven without revealing users' identity, and users can use cloud services without any threat of profiling their behavior. However, if a user breaks provider's rules, his access right is revoked.Our solution provides anonymous access, unlinkability and the confidentiality of transmitted data. We implement our solution as a proof of concept applicationand present the experimental results. Further, we analyzecurrent privacy preserving solutions for cloud services and group signature schemes as basic parts of privacy enhancing solutions in cloud services. We compare the performance of our solution with the related solutionsand schemes.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Anonymous authentication]]></kwd>
<kwd lng="en"><![CDATA[Cloud services]]></kwd>
<kwd lng="en"><![CDATA[Cryptography]]></kwd>
<kwd lng="en"><![CDATA[Encryption]]></kwd>
<kwd lng="en"><![CDATA[Group signatures]]></kwd>
<kwd lng="en"><![CDATA[Privacy]]></kwd>
<kwd lng="en"><![CDATA[Security]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="center"><font face="verdana" size="4"><b>Privacy&#45;preserving security solution for cloud services</b></font></p>      <p align="justify">&nbsp;</p>     <p align="center"><font face="verdana" size="2"><b>L. Malina*, J. Hajny, P. Dzurenda and V. Zeman</b></font></p>     <p align="center">&nbsp;</p>      <p align="justify"><font face="verdana" size="2"><i>Department od Telecommunications Brno University of Technology Brno, Czech Republic</i>. *<a href="mailto:malina@feec.vutbr.cz">malina@feec.vutbr.cz</a></font></p>  	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><b>ABSTRACT</b></font></p>      <p align="justify"><font face="verdana" size="2">We propose a novel privacy&#45;preserving security solution for cloud services. Our solution is based on an efficient non&#45;bilinear group signature scheme providing the anonymous access to cloud services and shared storage servers. The novel solution offers anonymous authenticationfor registered users. Thus, users' personal attributes (age, valid registration, successful payment) can be proven without revealing users' identity, and users can use cloud services without any threat of profiling their behavior. However, if a user breaks provider's rules, his access right is revoked.Our solution provides anonymous access, unlinkability and the confidentiality of transmitted data. We implement our solution as a proof of concept applicationand present the experimental results. Further, we analyzecurrent privacy preserving solutions for cloud services and group signature schemes as basic parts of privacy enhancing solutions in cloud services. We compare the performance of our solution with the related solutionsand schemes.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Anonymous authentication, Cloud services, Cryptography, Encryption, Group signatures, Privacy, Security.</font></p>  	    ]]></body>
<body><![CDATA[<p align="justify">&nbsp;</p>     <p align="justify"><font face="verdana" size="2"><a href="/pdf/jart/v13n1/v13n1a2.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><b>Acknowledgments</b></font></p>         <p align="justify"><font face="verdana" size="2">This research work is funded by project SIX CZ.1.05/2.1.00/03.0072; the Technology Agency of the Czech Republic projects TA02011260 and TA03010818; the Ministry of Industry and Trade of the Czech Republic project FR&#45;TI4/647.</font></p>         <p align="justify"></p>     <p align="justify">&nbsp;</p>     <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;1&#93;&nbsp;Y. Chen and R. Sion, "On securing untrusted clouds with cryptography" in Proceedings of the 9th annual ACM workshop on Privacy in the electronic society, New Your k,ACM, 2010, pp.109&#45;114.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853234&pid=S1665-6423201500010000200001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;2&#93; C. Wang, et al., "Privacy&#45;preserving public auditing for data storage security in cloud computing", in INFOCOM,2010 Proceedings IEEE, San Diego march </font><font face="verdana" size="2">2010, pp. 1&#45;9.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853236&pid=S1665-6423201500010000200002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font> </p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;3&#93; Q. Wang et al. "Enabling public auditability and data dynamics for storage security in cloud computing", in Parallel and Distributed Systems, IEEE Transactions on, vol. 22, no. 5,IEEE, 2011. pp. 847&#45;859.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853238&pid=S1665-6423201500010000200003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;4&#93; R. Laurikainen, "Secure and anonymous communication in the cloud", in Aalto University School of Science and Technology, Department of Computer Science and Engineering, Tech. Rep. TKK&#45;CSE&#45;B10, 2010, pp. 1&#45;5</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853240&pid=S1665-6423201500010000200004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">&#91;5&#93; M. Mowbray and S. Pearson, "A client&#45;based privacy manager for cloud computing", in Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middle waRE, ser. COMSWARE '09, New York, ACM, 2009, pp. 5:1&#45;5:8.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853241&pid=S1665-6423201500010000200005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;6&#93; E.M. Hernandez&#45;Ramirez et al. "A Comparison of Redundancy Techniques for Private and Hybrid Cloud Storage", in JART Journal of Applied Research and Technology, vol. 10, no. 6, pp. 1&#45;9, 2012.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853243&pid=S1665-6423201500010000200006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;7&#93; M. Jensen et al., "Towards an anonymous access control and accountability scheme for cloud computing", in Cloud Computing (CLOUD), 2010 IEEE 3rd International Conference on, Miami, IEEE. 2010, pp. 540 &#45;541.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853245&pid=S1665-6423201500010000200007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;8&#93; D. Chaum and E. Van Heyst, "Group signatures", in Advances in Cryptology EUROCRYPT91. 1991, pp. </font><font face="verdana" size="2">257&#45;265.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853247&pid=S1665-6423201500010000200008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;9&#93; P. Angin et al., "An entity&#45;centric approach for privacy and identity management in cloud computing", in Reliable Distributed Systems, 2010 29th IEEE Symposium on, New Delhi, IEEE. 2010, pp. 177&#45;183.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853249&pid=S1665-6423201500010000200009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;10&#93; A. Fiat and A. Shamir, "How to prove yourself: practical solutions to identification and signature problems", in Advances in Cryptology&#45;Crypto86. 1987, pp. 186&#45;194.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853251&pid=S1665-6423201500010000200010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;11&#93;&nbsp;M. Blanton, "Online subscriptions with anonymous access," in Proceedings of the 2008 ACM symposium on Information, computer and communications security, ser. ASIACCS '08, New York, ACM. 2008, pp. 217&#45;227.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853253&pid=S1665-6423201500010000200011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;12&#93; J. Camenisch and A. Lysyanskaya, "Signature schemes and anonymous credentials from bilinear maps", in Advances in Cryptology&#45; CRYPTO2004, 24th Annual International Cryptology Conference, Santa Barbara, California, USA. 2004, pp. 56&#45;72.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853255&pid=S1665-6423201500010000200012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;13&#93; R. Lu et al., "Secure provenance: the essential of bread and butter of data forensics in cloud computing", in Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ser. ASIACCS '10, New York, ACM, 2010, pp. 282&#45;292.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853257&pid=S1665-6423201500010000200013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;14&#93; S. Chow et al., "Spice&#45;simple privacy&#45;preserving identity&#45;management for cloud environment", in Applied Cryptography and Network Security. 2012, pp. 526&#45;543.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853259&pid=S1665-6423201500010000200014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;15&#93; X. Boyen and B. Waters, "Compact group signatures without random oracles", in Advances in Cryptology&#45;</font><font face="verdana" size="2">EUROCRYPT 2006. 2006, pp. 427&#45;444.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853261&pid=S1665-6423201500010000200015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;16&#93; L. Malina and J. Hajny, "Accelerated modular arithmetic for low&#45;performance devices", in Telecommunications and Signal Processing(TSP), 2011 34th International Conference on, Budapest, IEEE. 2011, pp. 131&#45;135.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853263&pid=S1665-6423201500010000200016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;17&#93; L. Malina and J. Hajny, "Efficient modular multiplication for programmable smart&#45;cards", in TelSys. Telecommunication Systems, pp.1&#45;8. 2013.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853265&pid=S1665-6423201500010000200017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;18&#93; X. Boyen and B. Waters, "Full&#45;domain subgroup hiding and constant&#45;size group signatures", Public Key Cryptography&#45;PKC 2007.Beijing, China. 2007, pp. 1&#45;15.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853267&pid=S1665-6423201500010000200018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;19&#93; J. Hajny and L. Malina, "Unlinkable attribute&#45;based credentials with practical revocation on smart&#45;cards", in Proceedings of the 11th international conference on Smart Card Research and Advanced Applications, ser. CARDIS'12. Springer&#45;Verlag, 2013, pp. 62&#45;76.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853269&pid=S1665-6423201500010000200019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;20&#93; R. Cramer, "Modular design of secure, yet practical cryptographic protocols", Ph.D. dissertation, University of Amsterdam, 1996.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853271&pid=S1665-6423201500010000200020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;21&#93; J. Camenisch and M. Stadler, "Proof systems for general statements about discrete logarithms", Tech. Rep., 1997.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853273&pid=S1665-6423201500010000200021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;22&#93; T. Okamoto and S. Uchiyama, "A new public&#45;key crypto system as secure as factoring", in Advances in Cryptology &#45; EUROCRYPT 98, ser. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, vol.1403, pp. 308&#45;318, 1998.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853275&pid=S1665-6423201500010000200022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;23&#93; J. Hajny and L. Malina, "Practical revocable anonymous credentials", in Communications and Multimedia Security, Canterbury, UK. 2012, pp. 211&#45;213.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853277&pid=S1665-6423201500010000200023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;24&#93; Z. Martinasek et al., "Optimization of differential poweranalysis", Przeglad elektrotechniczny,vol. 87, no. </font><font face="verdana" size="2">12, pp. 140&#45;144, 2011.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853279&pid=S1665-6423201500010000200024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;25&#93; L. Mart&iacute;nez&#45;Ramos et al., "Achieving Identity&#45;Based Cryptography in a Personal Digital Assistant Device". JART. Journal of Applied Research and Technology, vol. 9. no. 3, pp. 1&#45;11, 2011.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853281&pid=S1665-6423201500010000200025&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;26&#93; J. Camenisch and M. Stadler, "Eficient group signatures chemes for large groups", in Advances in Cryptology &#151; CRYPTO '97, California, USA. 1997, pp. </font><font face="verdana" size="2">410&#45;424, 2011.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853283&pid=S1665-6423201500010000200026&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;27&#93; G. Ateniese et al., "A practical and provably secure group signature scheme", in proceedings of CRYPTO '00. </font><font face="verdana" size="2">2000, pp. 255&#45;270.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853285&pid=S1665-6423201500010000200027&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;28&#93; G. Ateniese et al., "Quasi&#45;efficient revocation in group signatures" in proceedings of Financial Cryptography '02. </font><font face="verdana" size="2">2002, pp. 183&#45;197.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853287&pid=S1665-6423201500010000200028&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;29&#93; G. Tsudik and S. Xu, "Accumulating composites and improved group signing", in proceedings of ASIACRYPT </font><font face="verdana" size="2">'03. 2003, pp. 269&#45;286.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853289&pid=S1665-6423201500010000200029&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;30&#93; D. Boneh and H. Shacham. "Group signatures with verifier&#45;local revocation", in Conference on Computer and Communications Security, Proceedings of the 11th ACM conference on Computer and communications security, Washington DC, USA. 2004, pp. 168 &#45; 177.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853291&pid=S1665-6423201500010000200030&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;31&#93; D. Boneh et al.,"Short group signatures", in Advances in Cryptology &#45; CRYPTO 2004, Santa Barbara, California, </font><font face="verdana" size="2">USA. 2004, pp. 41&#45;55.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853293&pid=S1665-6423201500010000200031&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;32&#93; M. Bellare et al., "Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions", in Advances in Cryptology &#45; EUROCRYPT '03, Warsaw, Poland. 2003, </font><font face="verdana" size="2">pp. 614&#45;629.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853295&pid=S1665-6423201500010000200032&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font> </p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;33&#93; G. Ateniese et al., "Practical group signatures without random oracles", IACR Cryptology ePrint Archive.pp. 1&#45;31, </font><font face="verdana" size="2">2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853297&pid=S1665-6423201500010000200033&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;34&#93; X. Liang et al., "Short group signature without random oracles", in Information and Communications Security, Zhengzhou, ICICS, China. 2007, pp. 69&#45;82.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853299&pid=S1665-6423201500010000200034&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;35&#93; J. Groth,"Fully anonymous group signatures without random oracles", in Advances in Cryptology &#45; ASIACRYPT 2007, Kuching, Malaysia. 2007, pp. 164&#45;180.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853301&pid=S1665-6423201500010000200035&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;36&#93; L. Nguyen and R. Safavi&#45;Naini, "Efficient and Provably Secure Trapdoor&#45;free Group Signature Schemes from Bilinear Pairings", in Advances in Cryptology &#45; ASIACRYPT 2004, Jeju Island, Korea. 2004, pp. 372&#45;386.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853303&pid=S1665-6423201500010000200036&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;37&#93; S. Zhou and D. Lin, "A shorter group signature with verifier&#45;location revocation and backward unlinkability", CryptologyePrint Archive, Report 2006/100. </font><font face="verdana" size="2">2006, pp. 1&#45;10.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4853305&pid=S1665-6423201500010000200037&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Sion]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[On securing untrusted clouds with cryptography]]></article-title>
<source><![CDATA[Proceedings of the 9th annual ACM workshop on Privacy in the electronic society]]></source>
<year>2010</year>
<page-range>109-114</page-range><publisher-loc><![CDATA[New Your ]]></publisher-loc>
<publisher-name><![CDATA[k,ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Privacy-preserving public auditing for data storage security in cloud computing]]></article-title>
<collab>INFOCOM</collab>
<source><![CDATA[Proceedings IEEE]]></source>
<year>2010</year>
<page-range>1-9</page-range><publisher-loc><![CDATA[San Diego ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Enabling public auditability and data dynamics for storage security in cloud computing]]></article-title>
<source><![CDATA[Parallel and Distributed Systems, IEEE Transactions on]]></source>
<year>2011</year>
<volume>22</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>847-859</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laurikainen]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Secure and anonymous communication in the cloud]]></article-title>
<collab>Aalto University School of Science^dTechnology, Department of Computer Science and Engineering</collab>
<source><![CDATA[Tech. Rep. TKK-CSE-B10]]></source>
<year>2010</year>
<page-range>1-5</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mowbray]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pearson]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A client-based privacy manager for cloud computing]]></article-title>
<source><![CDATA[Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middle waRE]]></source>
<year>2009</year>
<page-range>5:1-5:8</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[COMSWARE '09ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernandez-Ramirez]]></surname>
<given-names><![CDATA[E.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Comparison of Redundancy Techniques for Private and Hybrid Cloud Storage]]></article-title>
<source><![CDATA[JART Journal of Applied Research and Technology]]></source>
<year>2012</year>
<volume>10</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>1-9</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jensen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Towards an anonymous access control and accountability scheme for cloud computing]]></article-title>
<collab>Cloud Computing</collab>
<source><![CDATA[]]></source>
<year>2010</year>
<page-range>540 -541</page-range><publisher-loc><![CDATA[Miami ]]></publisher-loc>
<publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chaum]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Van Heyst]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Group signatures]]></article-title>
<source><![CDATA[Advances in Cryptology EUROCRYPT91]]></source>
<year>1991</year>
<page-range>257-265</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Angin]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[An entity-centric approach for privacy and identity management in cloud computing]]></article-title>
<source><![CDATA[Reliable Distributed Systems]]></source>
<year>2010</year>
<page-range>177-183</page-range><publisher-loc><![CDATA[New Delhi ]]></publisher-loc>
<publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fiat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Shamir]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[How to prove yourself: practical solutions to identification and signature problems]]></article-title>
<source><![CDATA[Advances in Cryptology-Crypto86]]></source>
<year>1987</year>
<page-range>186-194</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blanton]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Online subscriptions with anonymous access]]></article-title>
<source><![CDATA[Proceedings of the 2008 ACM symposium on Information, computer and communications security, ser. ASIACCS '08]]></source>
<year>2008</year>
<page-range>217-227</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Camenisch]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lysyanskaya]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Signature schemes and anonymous credentials from bilinear maps]]></article-title>
<source><![CDATA[Advances in Cryptology- CRYPTO2004, 24th Annual International Cryptology Conference]]></source>
<year>2004</year>
<page-range>56-72</page-range><publisher-loc><![CDATA[Santa Barbara^eCalifornia California]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Secure provenance: the essential of bread and butter of data forensics in cloud computing]]></article-title>
<source><![CDATA[Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ser. ASIACCS '10]]></source>
<year>2010</year>
<page-range>282-292</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chow]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Spice-simple privacy-preserving identity-management for cloud environment]]></article-title>
<source><![CDATA[Applied Cryptography and Network Security]]></source>
<year>2012</year>
<page-range>526-543</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boyen]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Waters]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Compact group signatures without random oracles]]></article-title>
<source><![CDATA[Advances in Cryptology-EUROCRYPT 2006]]></source>
<year>2006</year>
<page-range>427-444</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malina]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Hajny]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Accelerated modular arithmetic for low-performance devices]]></article-title>
<source><![CDATA[Telecommunications and Signal Processing(TSP), 2011 34th International Conference on]]></source>
<year>2011</year>
<page-range>131-135</page-range><publisher-loc><![CDATA[Budapest ]]></publisher-loc>
<publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malina]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[H]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Efficient modular multiplication for programmable smart-cards]]></article-title>
<collab>TelSys</collab>
<source><![CDATA[Telecommunication Systems]]></source>
<year>2013</year>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boyen]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Waters]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Full-domain subgroup hiding and constant-size group signatures]]></article-title>
<source><![CDATA[Public Key Cryptography-PKC 2007]]></source>
<year>2007</year>
<page-range>1-15</page-range><publisher-loc><![CDATA[Beijing ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hajny]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Malina]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Unlinkable attribute-based credentials with practical revocation on smart-cards]]></article-title>
<source><![CDATA[Proceedings of the 11th international conference on Smart Card Research and Advanced Applications, ser. CARDIS'12]]></source>
<year>2013</year>
<page-range>62-76</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cramer]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Modular design of secure, yet practical cryptographic protocols]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Camenisch]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Stadler]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Proof systems for general statements about discrete logarithms]]></article-title>
<source><![CDATA[Tech. Rep.]]></source>
<year>1997</year>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Okamoto]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Uchiyama]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A new public-key crypto system as secure as factoring]]></article-title>
<source><![CDATA[Advances in Cryptology - EUROCRYPT 98]]></source>
<year>1998</year>
<volume>1403</volume>
<page-range>308-318</page-range><publisher-name><![CDATA[Springer BerlinHeidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hajny]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Malina]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Practical revocable anonymous credentials]]></article-title>
<source><![CDATA[Communications and Multimedia Security]]></source>
<year>2012</year>
<page-range>211-213</page-range><publisher-loc><![CDATA[Canterbury ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martinasek]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimization of differential poweranalysis]]></article-title>
<source><![CDATA[Przeglad elektrotechniczny]]></source>
<year>2011</year>
<volume>87</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>140-144</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez-Ramos]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Achieving Identity-Based Cryptography in a Personal Digital Assistant Device]]></article-title>
<source><![CDATA[JART. Journal of Applied Research and Technology]]></source>
<year>2011</year>
<volume>9</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1-11</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Camenisch]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Stadler]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Eficient group signatures chemes for large groups]]></article-title>
<source><![CDATA[Advances in Cryptology - CRYPTO '97]]></source>
<year>1997</year>
<page-range>410-424</page-range><publisher-loc><![CDATA[^eCalifornia California]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ateniese]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A practical and provably secure group signature scheme]]></article-title>
<source><![CDATA[proceedings of CRYPTO '00]]></source>
<year>2000</year>
<page-range>255-270</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ateniese]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Quasi-efficient revocation in group signatures]]></article-title>
<source><![CDATA[proceedings of Financial Cryptography '02]]></source>
<year>2002</year>
<page-range>183-197</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tsudik]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Accumulating composites and improved group signing]]></article-title>
<source><![CDATA[proceedings of ASIACRYPT '03]]></source>
<year>2003</year>
<page-range>269-286</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boneh]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Shacham]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Group signatures with verifier-local revocation]]></article-title>
<source><![CDATA[Conference on Computer and Communications Security, Proceedings of the 11th ACM conference on Computer and communications security]]></source>
<year>2004</year>
<page-range>168 - 177</page-range><publisher-loc><![CDATA[Washington^eDC DC]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boneh]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Short group signatures]]></article-title>
<source><![CDATA[Advances in Cryptology - CRYPTO 2004]]></source>
<year>2004</year>
<page-range>41-55</page-range><publisher-loc><![CDATA[Santa Barbara^eCalifornia California]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bellare]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions]]></article-title>
<source><![CDATA[Advances in Cryptology - EUROCRYPT '03]]></source>
<year>2003</year>
<page-range>614-629</page-range><publisher-loc><![CDATA[Warsaw ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ateniese]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Practical group signatures without random oracles]]></source>
<year>2005</year>
<page-range>1-31</page-range><publisher-name><![CDATA[IACR Cryptology ePrint Archive]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Short group signature without random oracles]]></article-title>
<source><![CDATA[Information and Communications Security]]></source>
<year>2007</year>
<page-range>69-82</page-range><publisher-loc><![CDATA[Zhengzhou ]]></publisher-loc>
<publisher-name><![CDATA[ICICS]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Groth]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fully anonymous group signatures without random oracles]]></article-title>
<source><![CDATA[Advances in Cryptology - ASIACRYPT 2007]]></source>
<year>2007</year>
<page-range>164-180</page-range><publisher-loc><![CDATA[Kuching ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nguyen]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Safavi-Naini]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Efficient and Provably Secure Trapdoor-free Group Signature Schemes from Bilinear Pairings]]></article-title>
<source><![CDATA[Advances in Cryptology - ASIACRYPT 2004]]></source>
<year>2004</year>
<page-range>372-386</page-range><publisher-loc><![CDATA[Jeju Island ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B37">
<label>37</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[A shorter group signature with verifier-location revocation and backward unlinkability]]></source>
<year>2006</year>
<page-range>1-10</page-range><publisher-name><![CDATA[CryptologyePrint Archive]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
