2020
DOI: 10.1049/iet-ifs.2018.5491
|View full text |Cite
|
Sign up to set email alerts
|

Implementing confidential transactions with lattice techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 33 publications
0
9
0
Order By: Relevance
“…Our confidential transactions also suffer from this limitation on the number of inputs and outputs. However, similar to [21], having binary commitments is more efficient than having large modulus like [25]. Moreover, our protocols are aggregable due to the static carries, unlike MatRiCT with volatile carries, which do not remove additional transactions' inputs.…”
Section: Related Workmentioning
confidence: 83%
See 2 more Smart Citations
“…Our confidential transactions also suffer from this limitation on the number of inputs and outputs. However, similar to [21], having binary commitments is more efficient than having large modulus like [25]. Moreover, our protocols are aggregable due to the static carries, unlike MatRiCT with volatile carries, which do not remove additional transactions' inputs.…”
Section: Related Workmentioning
confidence: 83%
“…a short vector, when the norm is γ and modulus is q γ. For example, [25]'s shortnorm vectors are [v, r 1 , r 2 ..] for some coin amount v and masking key [r 1 , r 2 ..]. However, such quantum-safe 4 latticebased CTs as [25] are not efficient and have limitations on the commitments that can be added.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For instance, the confidential transactions technique discussed in [45] can be adopted where the buyer and seller have contracts that contain price and other confidential information. The technique of confidential transactions is to keep the price amount secret and to grant verifiers the ability to check the validity of amounts [46]. In this case, buyer and seller perform a two-stage encryption process.…”
Section: Table I Price Adjustment and Execution Algorithmmentioning
confidence: 99%
“…A public distributed transaction ledger records all new committed transactions in blocks, with every new committed transaction appended to the previous block. Hash functions generate a user address or shorten the size of the public address using SHA-256 and Scrypt algorithms to prevent forging [5]. Every transaction among the blocks bears a timestamp, and a hash value links them all in chronological order.…”
Section: Introductionmentioning
confidence: 99%