Witness Encryption with (Weak) Unique Decryption and Message Indistinguishability: Constructions and Applications
Paper i proceeding, 2019

In this paper, we investigate WE scheme with the unique decryption and message indistinguishability, as well as its compelling applications. Our contributions are three-fold: (i) we first propose the notion of WE with MI and weak unique decryption, and give a construction based on public-coin differing-inputs obfuscation (diO), pseudorandom generator, and the Goldreich-Levin hard-core predicate; (ii) We show that our WE with MI and weak unique decryption can be used to construct a 4-round non-black-box honest-verifier zero-knowledge argument protocol; and (iii) We present a WE scheme with unique decryption and MI based on public-coin diO and weak auxiliary input multi-bit output point obfuscation (AIMPO). Moreover, we show that using our WE with unique decryption, we can get rid of the limitation of honest-verifier zero-knowledge property, thus yielding a 4-round non-black-box zero-knowledge argument.

Witness encryption

Unique decryption


Differing-inputs obfuscation


Dongxue Pan

Chinese Academy of Sciences

Bei Liang

Chalmers, Data- och informationsteknik, Nätverk och system

Hongda Li

Chinese Academy of Sciences

Peifang Ni

Chinese Academy of Sciences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 11547 609-619
978-3-030-21548-4 (ISBN)

24th Australasian Conference on Information Security and Privacy (ACISP)
Christchurch, New Zealand,

PRECIS: Integritet och säkerhet i bärbara datorprylar

Vetenskapsrådet (VR) (2014-4845), 2015-01-01 -- 2018-12-31.


Algebra och logik


Datavetenskap (datalogi)



Mer information

Senast uppdaterat