Filters








7 Hits in 2.0 sec

Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes [article]

Thomas Debris-Alazard and Nicolas Sendrier and Jean-Pierre Tillich
2019 arXiv   pre-print
We present here a new family of trapdoor one-way Preimage Sampleable Functions (PSF) based on codes, the Wave-PSF family.  ...  The trapdoor function is one-way under two computational assumptions: the hardness of generic decoding for high weights and the indistinguishability of generalized (U,U+V)-codes.  ...  Given a one-way preimage sampleable code-based function (Trapdoor, InvertAlg) we easily define a code-based FDH signature scheme as follows.  ... 
arXiv:1810.07554v2 fatcat:7cxwckxrergffcwcccx22odc7q

Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles [chapter]

Markus Rückert
2010 Lecture Notes in Computer Science  
Moreover, we show how to directly implement identity-based, and even hierarchical identity-based, signatures (IBS) in the same strong security model without random oracles.  ...  We equip all constructions with strong security proofs based on mild worst-case assumptions on lattices and we also propose concrete security parameters.  ...  Acknowledgments The author would like to thank Benoît Libert for a helpful discussion on HIBS. He also thanks Pierre-Louis Cayrel and Dominique Schröder for reviewing parts of this work.  ... 
doi:10.1007/978-3-642-12929-2_14 fatcat:r2goh4grkzdl5ek6ddhc4llb3e

A Decade of Lattice Cryptography

Chris Peikert
2016 Foundations and Trends® in Theoretical Computer Science  
Lattice-based cryptography is the use of conjectured hard problems on point lattices in R n as the foundation for secure cryptographic systems.  ...  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  ...  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.  ... 
doi:10.1561/0400000074 fatcat:5orjj3lrufdalfufl7ju6rnz3e

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  
We would also like to thank Springer-Verlag, and in particular Ruth Allewelt and Martin Peters, for their support.  ...  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.  ...  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

On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks

Dana Dachman-Soled
2017
We study the black box complexity of non-malleable encryption and optimally-fair coin tossing, showing a positive result for the former and a negative one for the latter.  ...  This security guarantee is essential for many applications such as auctions.  ...  Π be a black-box construction for two-party optimally-fair coin tossing based on one-way functions with input and output length n.  ... 
doi:10.7916/d8k64r2w fatcat:24onor73svhcvewlmqxezt6eai

Minimal assumptions in cryptography [article]

Nils Fleischhacker, Universität Des Saarlandes, Universität Des Saarlandes
2017
Secondly, we establish a bound on the potential tightness of security proofs for Schnorr signatures.  ...  First and foremost I thank Dominique Schröder for the opportunity of working with him, for the support during my years as a PhD student, and for helping me getting to know the amazing people that are the  ...  This allows to prove a nearly optimal unconditional tightness bound for all generic reductions and any representation-invariant computational problem Π.  ... 
doi:10.22028/d291-26696 fatcat:5whfuce6yndyzpnbs3ih2gicja

Coding techniques in lattice-based cryptography

Jiabo Wang, Cong Ling, China Scholarship Council
2021
The work done in this thesis introduces source and channel coding techniques to optimize specific parts of lattice-based cryptographic schemes from an information theoretic standpoint, with a particular  ...  In the second part, we for the first time formulate the ring-LWE based public key encryption as an i.i.d. fading channel and construct polar codes for it.  ...  The message µ is hashed to be u and trapdoor preimage sampling is employed to sample a short vector on coset lattice Λ ⊥ u (A) as the signature.  ... 
doi:10.25560/88513 fatcat:opbx72ijp5g6nlitg37attsvnu