Efficient non-interactive range proof
We propose the first constant size non-interactive range proof which is not based on the heuristic Fiat-Shamir transformation and whose security does not rely on the random oracle assumption. The proof consists of a constant number of group elements. Compared with the most efficient constant-size ra...
Saved in:
Main Authors: | YUEN, Tsz Hon, HUANG, Qiong, MU, Yi, SUSILO, Willy, WONG, Duncan S., YANG, Guomin |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7380 https://ink.library.smu.edu.sg/context/sis_research/article/8383/viewcontent/Efficient_non_interactive_range_proof.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Efficient strong designated verifier signature schemes without random oracle or with non-delegatability
by: HUANG, Qiong, et al.
Published: (2011) -
Ambiguous optimistic fair exchange
by: HUANG, Qiong, et al.
Published: (2008) -
A new efficient optimistic fair exchange protocol without random oracles
by: HUANG, Qiong, et al.
Published: (2012) -
Efficient optimistic fair exchange secure in the multi-user setting and chosen-key model without random oracles
by: HUANG, Qiong, et al.
Published: (2008) -
Ambiguous optimistic fair exchange: Definition and constructions
by: HUANG, Qiong, et al.
Published: (2015)