Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise

Jain, Abhishek; Krenn, Stephan; Pietrzak, Krzysztof; Tentes, Aris

doi:10.1007/978-3-642-34961-4_40

Cited by 91 publications

(69 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subsequently, we slightly modify the field version of the protocol to a mutually authentication protocol with less computation and communication complexity and to make the protocol MIM-free and to resist a very recent attack proposed in [19] against Ring-LPN. Computation Requirement: Following exact-LPN version in [10] yields the completeness error ε c = 0 ( whereas ε c ≈ 2 −55 in [16]). Field-LPN as we followed can do sparse multiplication for π i that takes 21k clock cycles while other multiplication requires 150k.…”

Section: Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

A Scalable and Secure RFID Ownership Transfer Protocol

Mamun

Miyaji

2014

2014 IEEE 28th International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

Ownership transfer in an RFID inventory system experiences many security and privacy oriented problems. We consider scenarios related to ownership transfer of RFID tags in a large inventory system. In this paper, we propose a new mutual authentication protocol from Ring LPN problem that leverages the reader authentication phase to incorporate Semi-Trusted Parties (STP) seamlessly in RFID ownership transfer protocol. Employing STPs could ease the ownership transfer process for the consumers in the remote location. More precisely, we introduce a new variant of Learning Parity from Noise (LPN) based mutual authentication scheme for efficient ownership transfer protocol where ownership of multiple tags can be transferred from one owner to another by taking advantages of an efficient homomorphic aggregated signature (HomSig) and pseudo-inverse matrix properties. To the best of our knowledge, this is the first RFID ownership transfer protocol from LPN problem that is secure, private and scalable under standard model.

show abstract

Section: Performance Evaluationmentioning

confidence: 99%

“…Proof : Interested readers are referred to[10], for further clarification and proof of the Proposition.…”

mentioning

confidence: 99%

A Scalable and Secure RFID Ownership Transfer Protocol

Mamun

Miyaji

2014

2014 IEEE 28th International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

show abstract

“…The statistical zero-knowledge arguments of knowledge presented in this work are Stern-like [50] protocols. In particular, they are Σ-protocols as defined in [27,9], where 3 valid transcripts are needed for extraction instead of just 2. Stern's protocol was originally proposed for code-based cryptography, and adapted to lattices by Kawachi et al [29].…”

Section: Zero-knowledge Argument Systems and Stern-like Protocolsmentioning

confidence: 99%

Zero-Knowledge Password Policy Check from Lattices

Nguyen

Tan

Wang

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Passwords are ubiquitous and most commonly used to authenticate users when logging into online services. Using high entropy passwords is critical to prevent unauthorized access and password policies emerged to enforce this requirement on passwords. However, with current methods of password storage, poor practices and server breaches have leaked many passwords to the public. To protect one's sensitive information in case of such events, passwords should be hidden from servers. Verifier-based password authenticated key exchange, proposed by Bellovin and Merrit (IEEE S&P, 1992), allows authenticated secure channels to be established with a hash of a password (verifier). Unfortunately, this restricts password policies as passwords cannot be checked from their verifier. To address this issue, Kiefer and Manulis (ESORICS 2014) proposed zero-knowledge password policy check (ZKPPC). A ZKPPC protocol allows users to prove in zero knowledge that a hash of the user's password satisfies the password policy required by the server. Unfortunately, their proposal is not quantum resistant with the use of discrete logarithm-based cryptographic tools and there are currently no other viable alternatives. In this work, we construct the first post-quantum ZKPPC using lattice-based tools. To this end, we introduce a new randomised password hashing scheme for ASCII-based passwords and design an accompanying zero-knowledge protocol for policy compliance. Interestingly, our proposal does not follow the framework established by Kiefer and Manulis and offers an alternate construction without homomorphic commitments. Although our protocol is not ready to be used in practice, we think it is an important first step towards a quantum-resistant privacy-preserving password-based authentication and key exchange system.

show abstract

“…As alternative to a collision resistant hash function, we could also use an almost pairwise independent hash function instead of the pairwise independent hash function. As commitment scheme, we use the simple and efficient construction of [23]. Their commitment scheme is perfectly binding and computationally hiding.…”

Section: A Ind-cca Secure Encryptionmentioning

confidence: 99%

Simple Chosen-Ciphertext Security from Low-Noise LPN

Kiltz

Masny

Pietrzak

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Recently, Döttling et al. (ASIACRYPT 2012) proposed the first chosen-ciphertext (IND-CCA) secure public-key encryption scheme from the learning parity with noise (LPN) assumption. In this work we give an alternative scheme which is conceptually simpler and more efficient. At the core of our construction is a trapdoor technique originally proposed for lattices by Micciancio and Peikert (EUROCRYPT 2012), which we adapt to the LPN setting. The main technical tool is a new double-trapdoor mechanism, together with a trapdoor switching lemma based on a computational variant of the leftover hash lemma.

show abstract

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise

Cited by 91 publications

References 37 publications

A Scalable and Secure RFID Ownership Transfer Protocol

A Scalable and Secure RFID Ownership Transfer Protocol

Zero-Knowledge Password Policy Check from Lattices

Simple Chosen-Ciphertext Security from Low-Noise LPN

Contact Info

Product

Resources

About