Filters








440 Hits in 6.4 sec

Post-quantum Cryptography: Code-Based Signatures [chapter]

Pierre-Louis Cayrel, Mohammed Meziani
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures.  ...  This survey provides a comparative overview of code-based signature schemes with respect to security and performance.  ...  In 1992, another blind signature scheme based on factoring and discrete logarithm-based identification schemes [31] have been developed.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13577-4_8">doi:10.1007/978-3-642-13577-4_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vji7yr5skjfjpnoaisoc3pg27a">fatcat:vji7yr5skjfjpnoaisoc3pg27a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809093833/https://www.informatik.tu-darmstadt.de/fileadmin/user_upload/Group_CASED/Publikationen/2010/Post-quantum_Cryptography_Code-Based_Signatures.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/dd/a1/dda16c6fbef4cd2cc4064759617c16a5174ccf78.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13577-4_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Post-Quantum Cryptography: Code-based Signatures [article]

Pierre-Louis Cayrel, Mohammed Meziani
<span title="2013-12-16">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures.  ...  This survey provides a comparative overview of code-based signature schemes with respect to security and performance.  ...  s scheme (ACG) The first non-generic code-based threshold ring signature scheme is introduced in [28] ; it generalizes Stern's identification protocol into a threshold ring signature scheme, using the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1312.4265v1">arXiv:1312.4265v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kdsuxv6scrfbthtsxqldf4z6ae">fatcat:kdsuxv6scrfbthtsxqldf4z6ae</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200901045619/https://arxiv.org/pdf/1312.4265v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b9/a9/b9a95e358081fb3030aa26fd51f6e27e435f1500.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1312.4265v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A Lattice-Based Threshold Ring Signature Scheme [chapter]

Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar's code-based solution to use the short integer solution (SIS) problem as security assumption, instead  ...  Such gain is also maintained through the application of the Fiat-Shamir heuristics to derive signatures from our identification scheme.  ...  Our Contribution Our work consists of a lattice-based threshold ring signature scheme, combining Aguilar's [2] and Cayrel's [11] results, and is based on an identification scheme that has lower soundness  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-14712-8_16">doi:10.1007/978-3-642-14712-8_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qxwi5lupm5fwlb4jzb7pzkvdpe">fatcat:qxwi5lupm5fwlb4jzb7pzkvdpe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228005631/http://pdfs.semanticscholar.org/8359/8a3b4ca9c138170dfe0a4e8bde6d63c33894.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/83/59/83598a3b4ca9c138170dfe0a4e8bde6d63c33894.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-14712-8_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Improved Zero-Knowledge Identification with Lattices

Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva
<span title="2012-01-01">2012</span> <i title="Walter de Gruyter GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ndvm4yozfbhtvjxfiowlwtdbty" style="color: black;">Tatra Mountains Mathematical Publications</a> </i> &nbsp;
Both the small soundness error and the mild assumption make our scheme more efficient than previous lattice-based ones. Moreover, by transferring code-based  ...  There is an efficient generic construction due to Fiat and Shamir that transforms any ID scheme into a signature scheme, in the random oracle model [14] .  ...  We have also presented a threshold ring signature scheme by generalizing a lattice-based identification scheme and applying the Fiat-Shamir transform to it.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/v10127-012-0038-4">doi:10.2478/v10127-012-0038-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xt42dbd7dvg4lhycgdg7slux3e">fatcat:xt42dbd7dvg4lhycgdg7slux3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503060201/https://content.sciendo.com/downloadpdf/journals/tmmp/53/1/article-p33.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/c6/7cc6cf43134c9ed78491d8a705c42136a9a99df7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/v10127-012-0038-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Traceable Ring Signature

E. FUJISAKI, K. SUZUKI
<span title="2008-01-01">2008</span> <i title="Institute of Electronics, Information and Communications Engineers (IEICE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/x2mklbxoqjfvjdjrdybgo53sdm" style="color: black;">IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences</a> </i> &nbsp;
At the same time, the ring signature provides great flexibility: No group manager, no special setup, and the dynamics of group choice.  ...  A traceable ring scheme is a ring signature except that it can restrict "excessive" anonymity.  ...  We refer to an ordered public key set pk N = (pk 1 , . . . , pk n ) as a ring. We define a traceable ring signature scheme as indicated below.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/ietfec/e91-a.1.83">doi:10.1093/ietfec/e91-a.1.83</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tzzjzpbvvfbalg7d5aowlxunei">fatcat:tzzjzpbvvfbalg7d5aowlxunei</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811000656/https://eprint.iacr.org/2006/389.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9c/8f/9c8f9aec04b3182c106dd76b5bba669ae4fee2d5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/ietfec/e91-a.1.83"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 3141 of Mathematical Reviews Vol. , Issue 2003d [page]

<span title="">2003</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The authors present a variant of the DSA signature scheme, called RDSA, whose security is based on the intractability of extracting roots in a finite abelian group.  ...  scheme based on the intractability of computing roots.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2003-04_2003d/page/3141" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2003-04_2003d/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Lattice Signatures and Bimodal Gaussians [chapter]

Léo Ducas, Alain Durmus, Tancrède Lepoint, Vadim Lyubashevsky
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In the full version of this paper [5], we explain the keygeneration procedure which results in a scheme whose security is based on the classic SIS q,n,m,β problem and we present an "NTRU-like" variant  ...  Our main result is a construction of a lattice-based digital signature scheme that represents an improvement, both in theory and in practice, over today's most efficient lattice schemes.  ...  In a nutshell, the fact that the distribution of the signatures in the scheme does not depend on the secret key means that the simulator can "sign" arbitrary messages without having the secret key by programming  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40041-4_3">doi:10.1007/978-3-642-40041-4_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pcpecmh6jzfhfb2tdktihuch4m">fatcat:pcpecmh6jzfhfb2tdktihuch4m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190219060635/http://pdfs.semanticscholar.org/16d9/16b69aa99a32d999068a376a5b4e96bfbd07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/16/d9/16d916b69aa99a32d999068a376a5b4e96bfbd07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40041-4_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

How to Leak a Secret: Theory and Applications of Ring Signatures [chapter]

Ronald L. Rivest, Adi Shamir, Yael Tauman
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and no coordination: any user can choose any set of possible signers that includes himself  ...  Our constructions of such signatures are unconditionally signer-ambiguous, secure in the random oracle model, and exceptionally efficient: adding each ring member increases the cost of signing or verifying  ...  Naor also provided an efficient protocol for deniable ring authentication based on any secure encryption scheme. The scheme is interactive.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11685654_7">doi:10.1007/11685654_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hpfx6kdtx5bvxj43yxth2yakbm">fatcat:hpfx6kdtx5bvxj43yxth2yakbm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130401202842/http://research.microsoft.com/en-us/um/people/yael/publications/2006-Leak_Secret.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a8/90/a89018b5e1bd0866922842ff33952b7d04ecc2ec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11685654_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Authentication Schemes Using Polynomials Over Non-Commutative Rings

Maheswara Rao Valluri
<span title="2012-12-31">2012</span> <i title="Academy and Industry Research Collaboration Center (AIRCC)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/sixpv35qe5fadj6agokethdf6u" style="color: black;">International Journal on Cryptography and Information Security</a> </i> &nbsp;
The aim of this paper is to propose two authentication schemes based on general non-commutative rings.  ...  The security of the schemes is based on the intractability of the polynomial symmetrical decomposition problem over the given non-commutative ring.  ...  They invented the concept of the encryption scheme and digital signature scheme based on public key. The trapdoor oneway functions play the key role in the idea of PKC.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijcis.2012.2406">doi:10.5121/ijcis.2012.2406</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cv6v3rpqtzhfffhifehnzgvlae">fatcat:cv6v3rpqtzhfffhifehnzgvlae</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200829092714/https://arxiv.org/ftp/arxiv/papers/1301/1301.2010.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/33/8e/338e54296932381dfa92d6e7b64cd2cc8bc70036.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijcis.2012.2406"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem [chapter]

Pierre-Louis Cayrel, Pascal Véron, Sidi Mohamed El Yousfi Alaoui
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The proposed scheme is zero-knowledge and relies on an NP-complete coding theory problem (namely the q-ary Syndrome Decoding problem).  ...  At CRYPTO'93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3.  ...  ring signature scheme [16] for example).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-19574-7_12">doi:10.1007/978-3-642-19574-7_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fgusbrhhxzhu7axnzatazdj55a">fatcat:fgusbrhhxzhu7axnzatazdj55a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140830030537/http://hal.inria.fr/docs/00/67/42/49/PDF/zkqsd.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b3/29/b329aa15b618ff04b4838734ef81d1f91dffc42c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-19574-7_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Improved Zero-Knowledge Identification with Lattices [chapter]

Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Döring, and R. Lindner. Efficiency improvement for NTRU. In A. Alkassar and J. H. Siekmann, editors, Sicherheit 2008: Sicherheit, Schutz und Zuverlässigkeit. Konferenzband der 4.  ...  The efficiency gain is based on the fact that some additive groups can be extended to rings.  ...  So, it does have a more efficient signature counterpart than ours. As an identification scheme, however, it is slightly less efficient. Lattice-Based Encryption.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16280-0_1">doi:10.1007/978-3-642-16280-0_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qphlhyww45avzim6wyo7bvnira">fatcat:qphlhyww45avzim6wyo7bvnira</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808024450/http://tuprints.ulb.tu-darmstadt.de/2387/1/diss-final.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ca/cb/cacb1f43cfa7d5bef329345bb12fb40901bf0ff9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16280-0_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Decade of Lattice Cryptography

Chris Peikert
<span title="">2016</span> <i title="Now Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xa5vf3kpovahzakczyfvsli7qq" style="color: black;">Foundations and Trends® in Theoretical Computer Science</a> </i> &nbsp;
The main focus is on the foundational short integer solution (SIS) and learning with errors (LWE) problems (and their more efficient ring-based variants), their provable hardness assuming the worst-case  ...  Lattice-based cryptography is the use of conjectured hard problems on point lattices in R n as the foundation for secure cryptographic systems.  ...  I warmly thank Vadim Lyubashevsky, Dieter van Melkebeek, Oded Regev, Noah Stephens-Davidowitz, Madhu Sudan, and an anonymous reviewer for many valuable comments on earlier drafts.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1561/0400000074">doi:10.1561/0400000074</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5orjj3lrufdalfufl7ju6rnz3e">fatcat:5orjj3lrufdalfufl7ju6rnz3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160309194316/http://eprint.iacr.org/2015/939.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/70/7c706717175b06fb332348235c494b0bfbe7db2a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1561/0400000074"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions

Chithralekha Balamurugan, Kalpana Singh, Ganeshvani Ganesan, Muttukrishnan Rajarajan
<span title="2021-12-20">2021</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ld7penalpndgxesxlh3sf425ee" style="color: black;">Cryptography</a> </i> &nbsp;
Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems, based on modular arithmetic to the contemporary cryptosystems based on quantum computing  ...  This paper provides an overview of the various research directions that have been explored in post-quantum cryptography and, specifically, the various code-based cryptography research dimensions that have  ...  Acknowledgments: This research work has been carried out under the leadership of the Institute for Technological Research SystemX, and therefore granted within the scope of the program "Recherche Exploratoire  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/cryptography5040038">doi:10.3390/cryptography5040038</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wkb43zunwjagbnljc6brfou4ty">fatcat:wkb43zunwjagbnljc6brfou4ty</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220104235943/https://mdpi-res.com/d_attachment/cryptography/cryptography-05-00038/article_deploy/cryptography-05-00038-v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ea/12/ea12a532aa5eb8de1be1f05a245721fa0ca97b78.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/cryptography5040038"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Fully Anonymous Attribute Tokens from Lattices [chapter]

Jan Camenisch, Gregory Neven, Markus Rückert
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The only currently known scheme based on assumptions that resist quantum attacks is the group signature scheme by Gordon et al. (ASIACRYPT 2010).  ...  We present two lattice-based constructions of this new primitive, one with and one without opening capabilities for the group manager.  ...  When constructing a group signature scheme from the non-frameable AAT+R scheme sketched above, one furthermore obtains the first group signature based on lattices offering non-frameability.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32928-9_4">doi:10.1007/978-3-642-32928-9_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/khkufyiwvndenor562we2xuvwy">fatcat:khkufyiwvndenor562we2xuvwy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705192633/https://eprint.iacr.org/2012/356.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/03/ed0374c1bef9ceacf92bfe66336e6b318aa88432.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32928-9_4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Code Based Cryptography and Steganography [chapter]

Pascal Véron
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The aim of this paper is to show how algebraic coding theory offers ways to define secure cryptographic primitives and efficient steganographic schemes. Cryptography  ...  Nowadays, coding theory plays an important role in the area of cryptography and steganography.  ...  The first practical steganographic scheme which incorporates the matrix embedding mechanism is the F5 algorithm [110]. A good starting point on Steganography and matrix embedding is [51] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40663-8_5">doi:10.1007/978-3-642-40663-8_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/t4a63pdm2bbtddmfm7uimzlmdu">fatcat:t4a63pdm2bbtddmfm7uimzlmdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923233751/https://hal.inria.fr/hal-00828034/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0f/2f/0f2f98bb89c95c570d2b68e1f1322fff3865fb95.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40663-8_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 440 results