Sender-Side Public Key Deniable Encryption Scheme

Howlader, Jaydeep; Basu, Saikat

doi:10.1109/artcom.2009.107

Cited by 11 publications

(13 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The DE schemes are potentially applicable for preventing vote buying in the internet-voting systems [2] and to provide secure multiparty computations [3]. One can distinguish sender-deniable [1,2], receiver-deniable [3], and bi-deniable [4] schemes in which coercer attacks the sender of secret message, the receiver, and the both parties of the communication session, respectively. The deniability is provided, if the sender or/and the receiver have possibility to open a fake message instead of the secret one and the coercer is not able to disclose their lie.…”

Section: Introductionmentioning

confidence: 99%

Stream deniable-encryption computationally indistinguishable from probabilistic ciphering

Berezin

Moldovyan

2015

2015 XVIII International Conference on Soft Computing and Measurements (SCM)

View full text Add to dashboard Cite

For the first time it is proposed a stream deniableencryption algorithm. The algorithm generates cryptogram that is computationally indistinguishable from the cryptogram produced by some probabilistic encryption algorithm, called associated probabilistic algorithm, while ciphering a fake message with a fake key. When the sender and receiver of the message are coerced to open the encryption key, they open the fake key with which the cryptogram is transformed into the fake message. To recover the secret message from the cryptogram the receiver uses the secret key. The algorithm is constructed on the base of some secure hash function with which two key streams are generated. The key streams are mixed with secret data stream and with fake data stream so that cryptograms looks like the ciphertext produced by the probabilistic encryption of the fake message with the fake key.

show abstract

Section: Introductionmentioning

confidence: 99%

Stream deniable-encryption computationally indistinguishable from probabilistic ciphering

Berezin

Moldovyan

2015

2015 XVIII International Conference on Soft Computing and Measurements (SCM)

View full text Add to dashboard Cite

show abstract

“…Abe & Suzuki [18] Chen et al [28] Her et al [29] Huang et al [30] Howlader et al [10] Gao et al [8] [21,12] ware proposed in [24,13] to relax the untappable channel. The notion of deniability allows the bidders to plausibly evade the coercer.…”

Section: Constraints and Assumptionsmentioning

confidence: 99%

“…They are Deniable Encryption, Coercer Resistant MIX and Distributed Key Generation. A Plan-Ahead Deniable Encryption (PDE) [21,12] outputs the cipher c d such that, the encryption of the fake and the true messages look alike. The PDE consists of three algorithms P DE(Enc, Dec, ϕ).…”

Section: Preliminariesmentioning

confidence: 99%

Practical Receipt-Free Sealed-Bid Auction in the Coercive Environment

Howlader

Roy

Mal

2014

Information Security and Cryptology -- ICISC 2013

Self Cite

View full text Add to dashboard Cite

Abstract. Sealed-Bid auction is an efficient and rational method to establish the price in open market. However sealed-bid auctions are subject to bid-rigging attack. Receipt-free mechanisms were proposed to prevent bid-rigging. The prior receipt-free mechanisms are based on two assumptions; firstly, existence of untappable channel between bidders and auction authorities. Secondly, mechanisms assume the authorities to be honest (not colluding). Moreover the bandwidth required to communicate the receipt-free bids is huge. This paper presents a sealed-bid auction mechanism to resist bid-rigging. The proposed method does not assume untappable channel nor consider the authorities to be necessarily honest. The proposed mechanism also manages the bandwidth efficiently, and improves the performance of the system.

show abstract

“…It is also inefficient and difficult to fit in the election/auction protocol. In [22], a sender-side deniable encryption scheme was introduced, based on the intractability assumption of the Quadratic Residuosity Problem [18]. The scheme used onetime-padding technique to encrypt a message.…”

Section: Related Workmentioning

confidence: 99%

“…In [22] a sender-side deniable encryption scheme was proposed. Let n is a product of two distinct large primes (p and q) of equal size.…”

Section: A Deniable Encryption Schemementioning

confidence: 99%

Uncoercibility In E-Voting And E-Auctioning Mechanisms Using Deniable Encryption

Howlader¹,

Nair²,

Basu³

et al. 2011

IJNSA

Self Cite

View full text Add to dashboard Cite

show abstract

Sender-Side Public Key Deniable Encryption Scheme

Cited by 11 publications

References 3 publications

Stream deniable-encryption computationally indistinguishable from probabilistic ciphering

Stream deniable-encryption computationally indistinguishable from probabilistic ciphering

Practical Receipt-Free Sealed-Bid Auction in the Coercive Environment

Uncoercibility In E-Voting And E-Auctioning Mechanisms Using Deniable Encryption

Contact Info

Product

Resources

About