Anonymity from Public Key Encryption to Undeniable Signatures

Aimani, Laila El

doi:10.1007/978-3-642-02384-2_14

Cited by 7 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we extend the result of [22,15] which derives anonymity from indistinguishability in public key encryption schemes, to tag-based encryption schemes. Let Γ be a tag-based encryption scheme given by the three algorithms Γ.keygen, Γ.encrypt, and Γ.decrypt.…”

Section: F3 Anonymitymentioning

confidence: 73%

Toward Practical Group Encryption

Aimani

Joye

2013

Applied Cryptography and Network Security

Self Cite

View full text Add to dashboard Cite

Abstract.A group encryption scheme allows anyone to form a ciphertext for a given group member while keeping the receiver's identity private. At the same time, the encryptor is capable of proving that some (anonymous) group member is able to decrypt the ciphertext and, optionally, that the corresponding plaintext satisfies some a priori relation (to prevent sending bogus messages). Finally, in case of a dispute, the identity of the intended receiver can be recovered by a designated authority. In this paper, we abstract a generic approach to construct group encryption schemes. We also introduce several new implementation tricks. As a result, we obtain group encryption schemes that significantly improve the state of the art. Both interactive and non-interactive constructions are considered.

show abstract

Section: F3 Anonymitymentioning

confidence: 73%

Toward Practical Group Encryption

Aimani

Joye

2013

Applied Cryptography and Network Security

Self Cite

View full text Add to dashboard Cite

show abstract

“…The main difference between our construction and those in [1,2] is that our construction supports the correctness check of a selective conversion, that is, given a message M, a signature σ and a selective converter cvt, one can efficiently check whether cvt is correctly computed from σ and the signer's secret key. This can be done by randomly choosing a message from the message space of the IBE scheme, encrypting it under the identity contained in σ , and then using cvt to decrypt the ciphertext.…”

Section: Remarkmentioning

confidence: 97%

“…There are also some existing generic constructions of convertible undeniable signature in the literature, for example [1,2], which basically follow the sign-then-encrypt paradigm. The main difference between our construction and those in [1,2] is that our construction supports the correctness check of a selective conversion, that is, given a message M, a signature σ and a selective converter cvt, one can efficiently check whether cvt is correctly computed from σ and the signer's secret key.…”

Section: Remarkmentioning

confidence: 99%

“…If the result is equal to the chosen message, cvt is valid; otherwise, it is invalid. While in [1,2], the selective converter is the standard signature encapsulated in the undeniable signature. It is not clear how to verify that the standard signature is indeed computed from the given undeniable signature, rather than simply re-generated by the signer.…”

Section: Remarkmentioning

confidence: 99%

See 1 more Smart Citation

Short and efficient convertible undeniable signature schemes without random oracles

Huang

Wong

2013

Theoretical Computer Science

View full text Add to dashboard Cite

a b s t r a c tA convertible undeniable signature allows a signer to confirm or disavow a non-selfauthenticating signature and also convert a valid one to a publicly verifiable signature. During the conversion, existing schemes either require the signer to be stateful, or have their security based on the random oracle assumption, or result in getting a large converter. In this work we propose a new construction, which supports both selective conversion and universal conversion, and is provably secure without random oracles. It has the shortest undeniable signature and the smallest converter. A signature consists of three bilinear group elements and just one group element each in a selective converter and a universal converter. The scheme can be extended further to support new features, such as the delegation of conversion and confirmation/disavowal, threshold conversion and others. We also propose an alternative generic construction of stateless convertible undeniable signature. Unlike the conventional 'sign-then-encrypt' paradigm, a signer in this new generic scheme encrypts a signature using identity-based encryption instead of public key encryption. It also enjoys the advantage of a short selective converter.

show abstract

“…SCUS schemes can also be used as a the main building block in protocols such as fair payment [3]. There is a long list of work on SCUS schemes in the literature, including [10,15,17,26,28] in the standard model.…”

Section: Introductionmentioning

confidence: 99%

Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions

Kurosawa

Nojima²,

Phong³

2014

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

Abstract. Verifiable random functions (VRF) and selectively-convertible undeniable signature (SCUS) schemes were proposed independently in the literature. In this paper, we observe that they are tightly related. This directly yields several deterministic SCUS schemes based on existing VRF constructions. In addition, we create a new probabilistic SCUS scheme, which is very compact. The confirmation and disavowal protocols of these SCUS are efficient, and can be run either sequentially, concurrently, or arbitrarily. These protocols are based on what we call zero-knowledge protocols for generalized DDH and non-DDH, which are of independent interest.

show abstract

Anonymity from Public Key Encryption to Undeniable Signatures

Cited by 7 publications

References 13 publications

Toward Practical Group Encryption

Toward Practical Group Encryption

Short and efficient convertible undeniable signature schemes without random oracles

Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions

Contact Info

Product

Resources

About