Fiat-Shamir with Aborts: From Identification Schemes to Linkable Ring Signatures

Das, Dipayan

doi:10.1007/978-3-030-66626-2_9

Cited by 3 publications

(1 citation statement)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later several other primitives have been developed based on those assumptions [9,10]. More recently, several primitives were built from related assumptions [11].…”

Section: Preamble: Public Key Encryptionmentioning

confidence: 99%

Encapsulating Secrets Using Lockable Obfuscation and a RMERS-Based Public Key Encryption

Simion

2022

Sustainability

View full text Add to dashboard Cite

Lockable obfuscation, a new primitive that occurs in cryptography, makes it possible to execute arbitrary polynomial-sized functions and recover a secret under specific equality conditions. More concretely, if the function executed over a specific input produces an output that matches an expected target value, here denoted by a, some secret string of bits s is exposed. Written in algebraic terms, if f:X→A has the property that for some x,f(x)=a, s is revealed. This work explores the possibility for safely decrypting ciphertexts, and based on the recovered plaintext’s equality to a stored message, to reveal some secret. Concretely, this work provides a review of existing, well-known public key encryption schemes and argues for the efficiency of a new one relying on the ratio Mersenne hypothesis (RMERS), which is to be used in conjunction with a lockable obfuscator. This work explores the advantage conferred by this scheme, especially in the minimization of the branching program’s number of levels that need to be obfuscated. The drawbacks of such schemes are also pointed out, given that they currently require the LWE evaluations level-per-level, one output bit at a time.

show abstract

“…Later several other primitives have been developed based on those assumptions [9,10]. More recently, several primitives were built from related assumptions [11].…”

Section: Preamble: Public Key Encryptionmentioning

confidence: 99%

Encapsulating Secrets Using Lockable Obfuscation and a RMERS-Based Public Key Encryption

Simion

2022

Sustainability

View full text Add to dashboard Cite

show abstract

Secure Boot in Post-Quantum Era

Agrawal,

Duraisamy,

Ganesan

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Shorter Linkable Ring Signature Based on Middle-Product Learning with Errors Problem

Lin

Sun

Wang

et al. 2022

The Computer Journal

View full text Add to dashboard Cite

DualRing is a novel generic construction introduced by Yuen et al. (CRYPTO’21), which can transform a special kind of (Type-T*) canonical identification scheme to a ring signature scheme. Compared with the classical approaches, this method can get a shorter signature. In this paper, we construct a new middle-product learning with errors (MPLWE)-based ring signature scheme by using this framework. Specifically, we propose a new MPLWE-based identification scheme, which is compatible with the DualRing, then we obtain a ring signature scheme by using DualRing framework. We also show how to achieve linkability from this ring signature by using a collision resistant hash function. In the end, we provide available parameter options for our (linkable) ring signature scheme. Under these parameters, the signature size of our linkable ring signature is $2-40 \times $ shorter (depending on the ring size) than the previous MPLWE-based scheme by Das et al. (Africacrypt’19).

show abstract

Fiat-Shamir with Aborts: From Identification Schemes to Linkable Ring Signatures

Cited by 3 publications

References 49 publications

Encapsulating Secrets Using Lockable Obfuscation and a RMERS-Based Public Key Encryption

Encapsulating Secrets Using Lockable Obfuscation and a RMERS-Based Public Key Encryption

Secure Boot in Post-Quantum Era

Shorter Linkable Ring Signature Based on Middle-Product Learning with Errors Problem

Contact Info

Product

Resources

About