A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
A Note on the Post-Quantum Security of (Ring) Signatures
[article]
2021
arXiv
pre-print
Preserved Fulltext
Prior to this work, the only known blind-unforgeable schemes are Lamport's one-time signature and the Winternitz one-time signature, and both of them are in the quantum random oracle model. ...
We present two short signature schemes achieving this notion: one is in the quantum random oracle model, assuming quantum hardness of SIS; and the other is in the plain model, assuming quantum hardness ...
May 19–23, 2019. ...
arXiv:2112.06078v1
fatcat:potybhcv7nfqbaw4ek5ggiklmu
Prisma: A Tierless Language for Enforcing Contract-Client Protocols in Decentralized Applications (Extended Version)
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present Prisma, a language for tierless decentralized applications, where the contract and its clients are defined in one unit and pairs of send and receive actions that "belong together ...
Decentralized applications (dApps) consist of smart contracts that run on blockchains and clients that model collaborating parties. dApps are used to model financial and legal business functionality. ...
In Yuval Ishai and Vincent Rijmen, editors, Advances in Cryptology -EUROCRYPT 2019 -38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, ...
arXiv:2205.07780v1
fatcat:plscefwjtjdvjmpzjzvqfetqhi
Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We develop our protocol on the grounds of the well-established field of Asynchronous Byzantine Fault Tolerant (ABFT) systems. ...
This allows us to formally reason about correctness, efficiency, and security in the strictest possible model, and thus convincingly prove the overall robustness of our solution. ...
In Advances in Cryptology -EUROCRYPT 2019 -38th Annual International Conference on the The-
ory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23,
2019, Proceedings, Part III ...
arXiv:1908.05156v2
fatcat:tenoy74wynghhime6xcznd3rqq
Almost Public Quantum Coins
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this work, we propose a way to lift any private quantum coin scheme -- which is known to exist based on the existence of one-way functions, due to Ji, Liu, and Song (CRYPTO'18) -- to a scheme that closely ...
The lifting technique when instantiated with the private quantum coins scheme, due to Mosca and Stebila 2010, gives rise to the first construction that is very close to an inefficient unconditionally secure ...
Rijmen, editors, Advances in Cryptology -EUROCRYPT 2019 -38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings ...
arXiv:2002.12438v3
fatcat:htaglq7p2vglddutqjayrfymju