Filters








20 Hits in 4.1 sec

Sealing the Leak on Classical NTRU Signatures [chapter]

Carlos Aguilar Melchor, Xavier Boyen, Jean-Christophe Deneuville, Philippe Gaborit
2014 Lecture Notes in Computer Science  
Deneuville Sealing the Leak on Classical NTRU Signatures PQC 2014 12/19 Outline Recalls on lattices Definitions Problems Signature Schemes NTRUSign Lyubashevsky Our scheme Security & Parameters  ...  Deneuville Sealing the Leak on Classical NTRU Signatures PQC 2014 12/19 Only a few signatures for original scheme [NR06] And a little more to break coutermeasures [DN12] 0 Number of signatures  ... 
doi:10.1007/978-3-319-11659-4_1 fatcat:nsa5k5dr5beh7erp7jfqkg7zsu

Loop-Abort Faults on Lattice-Based Fiat-Shamir and Hash-and-Sign Signatures [chapter]

Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi
2017 Lecture Notes in Computer Science  
Almost all primitives of classical cryptography (and more!)  ...  can be realized with lattices, and the efficiency of primitives like encryption and signatures has gradually improved to the point that key sizes are competitive with RSA at similar security levels, and  ...  small degree, in which case signatures will leak information about the private signing key.  ... 
doi:10.1007/978-3-319-69453-5_8 fatcat:hw3exefqv5di3nferrcwblsyny

A signature scheme from the finite field isomorphism problem

Jeffrey Hoffstein, Joseph H. Silverman, William Whyte, Zhenfei Zhang
2020 Journal of Mathematical Cryptology  
In this paper, we investigate how one might build a digital signature scheme from this new problem.  ...  Intuitively, the hidden field isomorphism allows us to convert short vectors in the underlying lattice of one field into generic looking vectors in an isomorphic field.  ...  Details are given in the cited references, but the important point is that the NTRU ring and the NTRU lattice are public values, and the NTRU lattice contains one or more very short vectors, a property  ... 
doi:10.1515/jmc-2015-0050 fatcat:omxyei3t6fcvzll7ftfw2lzium

A signature scheme from the finite field isomorphism problem [article]

Jeffrey Hoffstein, Joseph H. Silverman, William Whyte, Zhenfei Zhang
2018 IACR Cryptology ePrint Archive  
In this paper, we investigate how one might build a digital signature scheme from this new problem.  ...  Intuitively, the hidden field isomorphism allows us to convert short vectors in the underlying lattice of one field into generic looking vectors in an isomorphic field.  ...  Details are given in the cited references, but the important point is that the NTRU ring and the NTRU lattice are public values, and the NTRU lattice contains one or more very short vectors, a property  ... 
dblp:journals/iacr/HoffsteinSWZ18 fatcat:iw2crqsqszdfjjrxteqgrezc24

Symmetric Cryptography [chapter]

2006 Security in Fixed and Wireless Networks  
Cryptographic algorithms are the equivalent of locks, seals, security stamps and identification documents on the Internet.  ...  Digital signature algorithms (in combination with hash functions) replace hand-written signatures in electronic transactions. A similar role can be played by MAC algorithms.  ...  that each signature leaks information on the signer's secret key, but this does not necessarily imply that such schemes are insecure.  ... 
doi:10.1002/0470863722.ch3 fatcat:kye7h3pmnbhkjksvyr4tj4nj7e

symmetric cryptography [chapter]

Martin H. Weik
2000 Computer Science and Communications Dictionary  
Cryptographic algorithms are the equivalent of locks, seals, security stamps and identification documents on the Internet.  ...  Digital signature algorithms (in combination with hash functions) replace hand-written signatures in electronic transactions. A similar role can be played by MAC algorithms.  ...  that each signature leaks information on the signer's secret key, but this does not necessarily imply that such schemes are insecure.  ... 
doi:10.1007/1-4020-0613-6_18768 fatcat:24uzmmq3pbekxhlquwjzglnsve

Post-Quantum Era Privacy Protection for Intelligent Infrastructures

Lukas Malina, Petr Dzurenda, Sara Ricci, Jan Hajny, Gautam Srivastava, Raimundas Matulevicius, Abasi-amefon O. Affia, Maryline Laurent, Nazatul Haque Sultan, Qiang Tang
2021 IEEE Access  
A practical case study on the Internet of Vehicles (IoV) is presented to demonstrate how PETs can be applied in reality.  ...  society, and (2) the increase of IoT/II applications and digital services with growing data collection capabilities are introducing new threats and risks on citizens' privacy.  ...  , e.g. homomorphic encryption (HElib, 13 Microsoft SEAL 14 ) or group signatures (group-signature-scheme-eval 15 ).  ... 
doi:10.1109/access.2021.3062201 fatcat:kqcwwqjfjnds7bzlrid7r6gjlu

Quantum Randomness in Cryptography—A Survey of Cryptosystems, RNG-Based Ciphers, and QRNGs

Anish Saini, Athanasios Tsokanos, Raimund Kirner
2022 Information  
In order to increase the level of the security of cryptographic systems based on random numbers, this survey focuses on three objectives: Cryptosystems with related cryptographic attacks, RNG-based cryptosystems  ...  Even though the cryptographic algorithms are public and their strength depends on the keys, cryptoanalysis of encrypted ciphers can significantly contribute to the unveiling of the cipher's key.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/info13080358 fatcat:c2wsomzpobbkvbwg46jcnfrhlq

Post-Quantum Cryptography [chapter]

Qijun Gu, Pascal Paillier, Tanja Lange, Edlyn Teske, Darrel Hankerson, Alfred Menezes, David Zhang, Feng Yue, Wangmeng Zuo, Jean-Jacques Quisquater, Gildas Avoine, Gerald Brose (+73 others)
2011 Encyclopedia of Cryptography and Security  
Scientists from all over the world gave talks on the state of the art of quantum computers and on cryptographic schemes that may be able to resist attacks by quantum computers.  ...  So, during one of the coffee breaks, we decided to edit a book on this subject. Springer-Verlag promptly agreed to publish such a volume.  ...  Acknowledgements We thank Phong Nguyen and Markus Rückert for helpful discussions on the practical security of lattice-based cryptography.  ... 
doi:10.1007/978-1-4419-5906-5_386 fatcat:ucdkilta7zc3voq7nqctmjkcr4

Using quantum key distribution for cryptographic purposes: a survey [article]

Romain Alléaume, Cyril Branciard, Jan Bouda, Thierry Debuisschert, Mehrdad Dianati, Nicolas Gisin, Mark Godfrey, Philippe Grangier, Thomas Langer, Norbert Lutkenhaus, Christian Monyk, Philippe Painchault, Momtchil Peev (+9 others)
2014 arXiv   pre-print
We first review and compare the properties of the existing key establishment techniques, QKD being one of them.  ...  The purpose of this survey article, which is mostly centered on European research results, is to contribute to such an analysis.  ...  Finally, R.A. warmly thanks Thomas Lawson, Damian Markham and Delphine Agut for their help on the manuscript. We acknowledge support from the European Union under project SECOQC (IST-2002-506813). R.  ... 
arXiv:quant-ph/0701168v3 fatcat:j3wuwqjuarav3ft6chdvdsaw5a

Open Identity Summit 2021 - Complete Volume

2021 Open Identity Summit  
We propose tackling this information using identity management functions and perform a systematic gap analysis based on the FIDIS typology of identity management systems.  ...  processed, the governance of personal information in data lakes has received only cursory attention.  ...  Bibliography The authors are co-editors of the IETF GNAP specification and would like to thank the participants of the working group.  ... 
dblp:conf/openidentity/X21 fatcat:o54xtce6rneehgbbpsr3vasvvq

Introduction to post-quantum cryptography [chapter]

Daniel J. Bernstein
Post-Quantum Cryptography  
The classic example is Merkle's hash-tree public-key signature system (1979), building upon a one-message-signature idea of Lamport and Diffie. • Code-based cryptography.  ...  One of many interesting examples is Patarin's "HFE v− " public-key-signature system (1996), generalizing a proposal by Matsumoto and Imai.  ...  v− , NTRU, etc.  ... 
doi:10.1007/978-3-540-88702-7_1 fatcat:z4iw2a5dmbh43kcoguj3wwpode

On the Statistical Leak of the GGH13 Multilinear Map and Some Variants [chapter]

Léo Ducas, Alice Pellet-Mary
2018 Lecture Notes in Computer Science  
On our way, we also make explicit and tighten the hidden exponents in the size of the parameters, as an eort to assess and improve the eciency of MMaps.  ...  Luckily, the leak is more noisy than in the unprotected method, making the straightforward attack unsuccessful.  ...  The authors are grateful to Alex Davidson, Nico Döttling and Damien Stehlé for helpful discussions.  ... 
doi:10.1007/978-3-030-03326-2_16 fatcat:s6kjoymgtjb3fnlutvgrp7cqxm

A Survey on Secure Computation Based on Homomorphic Encryption in Vehicular Ad Hoc Networks

Xiaoqiang Sun, F. Richard Yu, Peng Zhang, Weixin Xie, Xiang Peng
2020 Sensors  
In this paper, we provide a comprehensive survey of secure computation based on homomorphic encryption in VANETs.  ...  We first describe the related definitions and the current state of homomorphic encryption.  ...  Acknowledgments: We thank the reviewers for their detailed reviews and constructive comments, which have helped to greatly improve the quality of this paper.  ... 
doi:10.3390/s20154253 pmid:32751627 fatcat:2m2lw3vutbh4tbynvotylachye

Strengthening EPC tags against cloning

Ari Juels
2005 Proceedings of the 4th ACM workshop on Wireless security - WiSe '05  
The EPC (Electronic Product Code) tag is a form of RFID (Radio-Frequency IDentification) device that is emerging as a successor to the printed barcode.  ...  In this paper, we present techniques that strengthen the resistance of EPC tags to elementary cloning attacks.  ...  Acknowledgments: Thanks to Dan Bailey, Burt Kaliski, and Steve Weis for their comments on and refinements to this paper and its ideas.  ... 
doi:10.1145/1080793.1080805 dblp:conf/ws/Juels05 fatcat:bh7kmptxprduhbrowzmbqvfe3i
« Previous Showing results 1 — 15 out of 20 results