SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions
dc.contributor.author
Lyubashevsky, Vadim
dc.contributor.author
Nguyen, Ngoc Khanh
dc.contributor.author
Seiler, Gregor
dc.contributor.editor
Malkin, Tal
dc.contributor.editor
Peikert, Chris
dc.date.accessioned
2021-10-13T09:32:59Z
dc.date.available
2021-10-08T02:35:20Z
dc.date.available
2021-10-13T09:32:59Z
dc.date.issued
2021
dc.identifier.isbn
978-3-030-84245-1
en_US
dc.identifier.isbn
978-3-030-84244-4
en_US
dc.identifier.issn
0302-9743
dc.identifier.issn
1611-3349
dc.identifier.other
10.1007/978-3-030-84245-1_21
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/508688
dc.description.abstract
In a set membership proof, the public information consists of a set of elements and a commitment. The prover then produces a zero-knowledge proof showing that the commitment is indeed to some element from the set. This primitive is closely related to concepts like ring signatures and "one-out-of-many" proofs that underlie many anonymity and privacy protocols. The main result of this work is a new succinct lattice-based set membership proof whose size is logarithmic in the size of the set.
We also give a transformation of our set membership proof to a ring signature scheme. The ring signature size is also logarithmic in the size of the public key set and has size 16 KB for a set of 2(5) elements, and 22 KB for a set of size 2(25). At an approximately 128-bit security level, these outputs are between 1.5x and 7x smaller than the current state of the art succinct ring signatures of Beullens et al. (Asiacrypt 2020) and Esgin et al. (CCS 2019).
We then show that our ring signature, combined with a few other techniques and optimizations, can be turned into a fairly efficient Monero-like confidential transaction system based on the MatRiCT framework of Esgin et al. (CCS 2019). With our new techniques, we are able to reduce the transaction proof size by factors of about 4X - 10X over the afore-mentioned work. For example, a transaction with two inputs and two outputs, where each input is hidden among 2(15) other accounts, requires approximately 30KB in our protocol.
en_US
dc.language.iso
en
en_US
dc.publisher
Springer
en_US
dc.title
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions
en_US
dc.type
Conference Paper
dc.date.published
2021-08-11
ethz.book.title
Advances in Cryptology – CRYPTO 2021
en_US
ethz.journal.title
Lecture Notes in Computer Science
ethz.journal.volume
12826
en_US
ethz.journal.abbreviated
LNCS
ethz.pages.start
611
en_US
ethz.pages.end
640
en_US
ethz.event
41st Annual International Cryptology Conference (CRYPTO 2021)
en_US
ethz.event.location
Online
en_US
ethz.event.date
August 16-20, 2021
en_US
ethz.identifier.wos
ethz.publication.place
Cham
en_US
ethz.publication.status
published
en_US
ethz.date.deposited
2021-10-08T02:35:46Z
ethz.source
WOS
ethz.eth
yes
en_US
ethz.availability
Metadata only
en_US
ethz.rosetta.installDate
2021-10-13T09:33:05Z
ethz.rosetta.lastUpdated
2021-10-13T09:33:05Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=SMILE:%20Set%20Membership%20from%20Ideal%20Lattices%20with%20Applications%20to%20Ring%20Signatures%20and%20Confidential%20Transactions&rft.jtitle=Lecture%20Notes%20in%20Computer%20Science&rft.date=2021&rft.volume=12826&rft.spage=611&rft.epage=640&rft.issn=0302-9743&1611-3349&rft.au=Lyubashevsky,%20Vadim&Nguyen,%20Ngoc%20Khanh&Seiler,%20Gregor&rft.isbn=978-3-030-84245-1&978-3-030-84244-4&rft.genre=proceeding&rft_id=info:doi/10.1007/978-3-030-84245-1_21&rft.btitle=Advances%20in%20Cryptology%20%E2%80%93%20CRYPTO%202021
Files in this item
Files | Size | Format | Open in viewer |
---|---|---|---|
There are no files associated with this item. |
Publication type
-
Conference Paper [35220]