File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-14081-5_22
- Scopus: eid_2-s2.0-78649900374
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Proof-of-knowledge of representation of committed value and its applications
Title | Proof-of-knowledge of representation of committed value and its applications |
---|---|
Authors | |
Issue Date | 2010 |
Citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, v. 6168 LNCS, p. 352-369 How to Cite? |
Abstract | We present a zero-knowledge argument system of representation of a committed value. Specifically, for commitments C = Commit1(y), D = Commit2(x), of value y and a tuple x = x1,..., x L), respectively, our argument system allows one to demonstrate the knowledge of (x,y) such that x is a representation of y to bases h1, ..., hL . That is, y = h1x1⋯h LxL. Our argument system is zero-knowledge and hence, it does not reveal anything such as x or y. We note that applications of our argument system are enormous. In particular, we show how round-optimal cryptography systems, where privacy is of a great concern, can be achieved. We select three interesting applications with the aim to demonstrate the significance our argument system. First, we present a concrete instantiation of two-move concurrently-secure blind signature without interactive assumptions. Second, we present the first compact e-cash with concurrently-secure withdrawal protocol. Finally, we construct two-move traceable signature with concurrently-secure join. On the side note, we present a framing attack against the original traceable signature scheme within the original model. © 2010 Springer-Verlag. |
Persistent Identifier | http://hdl.handle.net/10722/280772 |
ISSN | 2020 SCImago Journal Rankings: 0.249 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Au, Man Ho | - |
dc.contributor.author | Susilo, Willy | - |
dc.contributor.author | Mu, Yi | - |
dc.date.accessioned | 2020-02-17T14:34:54Z | - |
dc.date.available | 2020-02-17T14:34:54Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, v. 6168 LNCS, p. 352-369 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/280772 | - |
dc.description.abstract | We present a zero-knowledge argument system of representation of a committed value. Specifically, for commitments C = Commit1(y), D = Commit2(x), of value y and a tuple x = x1,..., x L), respectively, our argument system allows one to demonstrate the knowledge of (x,y) such that x is a representation of y to bases h1, ..., hL . That is, y = h1x1⋯h LxL. Our argument system is zero-knowledge and hence, it does not reveal anything such as x or y. We note that applications of our argument system are enormous. In particular, we show how round-optimal cryptography systems, where privacy is of a great concern, can be achieved. We select three interesting applications with the aim to demonstrate the significance our argument system. First, we present a concrete instantiation of two-move concurrently-secure blind signature without interactive assumptions. Second, we present the first compact e-cash with concurrently-secure withdrawal protocol. Finally, we construct two-move traceable signature with concurrently-secure join. On the side note, we present a framing attack against the original traceable signature scheme within the original model. © 2010 Springer-Verlag. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Proof-of-knowledge of representation of committed value and its applications | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-14081-5_22 | - |
dc.identifier.scopus | eid_2-s2.0-78649900374 | - |
dc.identifier.volume | 6168 LNCS | - |
dc.identifier.spage | 352 | - |
dc.identifier.epage | 369 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.issnl | 0302-9743 | - |