50 Hits in 8.8 sec

Towards Practical Lattice-Based One-Time Linkable Ring Signatures [chapter]

Carsten Baum, Huang Lin, Sabine Oechsner
2018 Lecture Notes in Computer Science  
We show how to instantiate efficient zero-knowledge protocols that can be used to prove a number of relations among these commitments, and apply these in the context of lattice-based threshold cryptosystems  ...  We present an additively homomorphic commitment scheme with hardness based on the Ring-SIS problem.  ...  Fiat-shamir with aborts: Applications to lattice and factoring-based signatures.  ... 
doi:10.1007/978-3-030-01950-1_18 fatcat:ymdodcwgvzeutgenjzqi4g4omu

A Lattice-Based Threshold Ring Signature Scheme [chapter]

Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva
2010 Lecture Notes in Computer Science  
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  ...  From security perspective we also have improvements, because our scheme exhibits a worst-case to average-case reduction typical of lattice-based cryptosystems.  ...  Lattice-Based Signature Schemes To the best of our knowledge, our threshold ring signature scheme is the first lattice-based.  ... 
doi:10.1007/978-3-642-14712-8_16 fatcat:qxwi5lupm5fwlb4jzb7pzkvdpe

Verifiable Decryption in the Head [article]

Kristian Gjøsteen, Thomas Haines, Johannes Müller, Peter B. Rønne, Tjerand Silde
2021 IACR Cryptology ePrint Archive  
This leads to an efficient lattice-based verifiable decryption with only one server; it has lightweight computations as we reduce the need of zero-knowledge proofs.  ...  To introduce our idea, we first present a toy example for an ElGamal distributed decryption protocol before applying our method to a lattice-based scheme.  ...  Comparison to Boschini et al. (PQCrypto 2020) Boschini et al. [BCOS20] presents a zero-knowledge protocol for Ring-SIS and Ring-LWE.  ... 
dblp:journals/iacr/GjosteenHMRS21 fatcat:pd4r5ii4frgwjdltiybm4akrka

Improved Zero-Knowledge Identification with Lattices

Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva
2012 Tatra Mountains Mathematical Publications  
Therefore, having an efficient ID solution from lattices gives rise to a similarly efficient signature construction, keeping the same hardness assumption.  ...  K e y w o r d s: lattice-based cryptography, identification scheme, hash function, SIS problem, zero-knowledge. This research was supported by CASED and FAPESP 33 P.  ...  We are grateful to an anonymous referee for helpful comments.  ... 
doi:10.2478/v10127-012-0038-4 fatcat:xt42dbd7dvg4lhycgdg7slux3e

Improved Zero-Knowledge Identification with Lattices [chapter]

Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva
2010 Lecture Notes in Computer Science  
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.  ...  Lattice-Based Zero-Knowledge Identification.  ...  We propose an efficiency improvement for SWIFFT, which is universally applicable to all schemes based on SIS and comes at no cost.  ... 
doi:10.1007/978-3-642-16280-0_1 fatcat:qphlhyww45avzim6wyo7bvnira

Homomorphic Encryption — Theory and Application [chapter]

Jaydip Sen
2013 Theory and Practice of Cryptography and Network Security Protocols and Technologies  
Zero-knowledge proofs: This is a fundamental primitive of cryptographic protocols and serves as an example of a theoretical application of homomorphic cryptosystems.  ...  Zeroknowledge proofs guarantee that the protocol communicates exactly the knowledge that was intended, and no (zero) extra knowledge.  ... 
doi:10.5772/56687 fatcat:amgaohpdbnal3ly6nsx4nvasmm

Homomorphic Encryption: Theory & Applications [article]

Jaydip Sen
2013 arXiv   pre-print
The goal of this chapter is to present a survey of homomorphic encryption techniques and their applications.  ...  Various applications and salient properties of homomorphic encryption schemes are then discussed in detail.  ...  Zero-knowledge proofs guarantee that the protocol communicates exactly the knowledge that was intended, and no (zero) extra knowledge.  ... 
arXiv:1305.5886v1 fatcat:agzyco4ehnfajiamrbp7qobo2a

Post-quantum cryptography: lattice identification schemes

2011 Publicationes mathematicae (Debrecen)  
This survey presents an overview and a comparative analysis of the state of art in post-quantum identification schemes based on lattices.  ...  Furthermore, we propose an adaptation of the HB family of identification in a lattice context.  ...  Xagawa and Tanaka [26] proposed zero-knowledge and proof-of-knowledge protocols for NTRU (short for N-th degree truncated polynomial ring) cryptosystem, using a statistically hiding and computationally  ... 
doi:10.5486/pmd.2011.5311 fatcat:qynhz2ewlzaznnxbb4h6cclbuu

Preparation for Post-Quantum era: a survey about blockchain schemes from a post-quantum perspective [article]

Andrada-Teodora Ciulei, Marian-Codrin Cretu, Emil Simion
2022 IACR Cryptology ePrint Archive  
This paper briefly presents the most relevant algorithms and procedures that have contributed to the progress of quantum computing and the categories of post-quantum cryptosystems.  ...  Blockchain is a type of Distributed Ledger Technology (DLT) that has been included in various types of fields due to its numerous benefits: transparency, efficiency, reduced costs, decentralization, and  ...  which participate indirectly in commitments construction and zero-knowledge proof [198] , [184] , [205] , [156] .  ... 
dblp:journals/iacr/CiuleiCS22 fatcat:dw3z6d6nnfc7lll55dwejilg5a

A Comprehensive Study of Fully Homomorphic Encryption Schemes

Majedah Alkharji, Mayyada Al Hammoshi, Hang Liu
2018 Figshare  
Fully homomorphic encryption (FHE) schemes.This work can be helpful as a guide to principles, properties of FHE  ...  He utilized ideal lattices to develop a bootstrappable encryption protocol.  ...  sums to zero (modulo q).  ... 
doi:10.6084/m9.figshare.6667562 fatcat:kaoey2rfkjamddzeni24f5t3dm

Lattice Signatures and Bimodal Gaussians [chapter]

Léo Ducas, Alain Durmus, Tancrède Lepoint, Vadim Lyubashevsky
2013 Lecture Notes in Computer Science  
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.  ...  NTRU SIS problem in terms of the R-SIS K q,1,2,β problem is to set R = Z[x]/(x n + 1) and let K be the distribution that picks small f , g and outputs the public key A = (a, 1) ∈ R 1×2 q for a = g/f .  ...  The proof of the theorem follows from standard arguments, and is simpler and tighter than the proof of [24] .  ... 
doi:10.1007/978-3-642-40041-4_3 fatcat:pcpecmh6jzfhfb2tdktihuch4m

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

Pierre-Louis Cayrel, Mohammed Meziani
2013 arXiv   pre-print
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.  ...  Security and Efficiency. Aguilar et al.'s identification scheme is a zero-knowledge protocol with a cheating probability of 2/3 as in Stern's scheme.  ... 
arXiv:1312.4265v1 fatcat:kdsuxv6scrfbthtsxqldf4z6ae

Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions [article]

Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde
2022 IACR Cryptology ePrint Archive  
The shuffle is based on an extension of a shuffle of commitments to known values which is combined with an amortized proof of correct re-randomization.  ...  While many efficient protocols exist from discrete log-type assumptions, the situation is less clear for post-quantum alternatives such as lattices.  ...  This can happen in two ways: Either the argument for the linear combination of the commitments to E i,j and s j is incorrect, or the bound on E i,j is incorrect.  ... 
dblp:journals/iacr/AranhaBGS22 fatcat:qn4rr3gw5zfpjdlkhsf24xyefe

On Constrained Implementation of Lattice-Based Cryptographic Primitives and Schemes on Smart Cards

Ahmad Boorghany, Siavash Bayat Sarmadi, Rasool Jalili
2015 ACM Transactions on Embedded Computing Systems  
Most lattice-based cryptographic schemes with a security proof suffer from large key sizes and heavy computations.  ...  However, to the best of our knowledge, no previous attempts were made to implement lattice-based schemes on smart cards.  ...  Acknowledgments The authors would like to thank the anonymous referees for their constructive reviews. Useful comments were also received from John Schanck on a preliminary version of this paper.  ... 
doi:10.1145/2700078 fatcat:d2dihnjmszf5rhojn74xcgkpgy

Homomorphic encryption algorithms and schemes for secure computations in the cloud

Majedah Alkharji, Hang Liu
2018 Figshare  
A detailed survey of homomorphic encryption (HE) using public key algorithms such as RSA, El-Gamal, and Paillier algorithms.2.  ...  Fully homomorphic encryption (FHE) schemes.This work can be helpful as a guide to principles, properties of FHE as researchers believe in the possibility of advancement in the FHE area.  ...  -Thirdly, Numerous lattice-based cryptographic cryptosystems are relied straight upon two average-case scenario problems, i.e., learning with errors (LWE) problem, and short integer solution (SIS) problem  ... 
doi:10.6084/m9.figshare.5996759.v1 fatcat:kunl4v6rynawjneutyvtttptpa
« Previous Showing results 1 — 15 out of 50 results