Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Theory of computation → Cryptographic protocols"'
Avalanche is a blockchain consensus protocol with exceptionally low latency and high throughput. This has swiftly established the corresponding token as a top-tier cryptocurrency. Avalanche achieves such remarkable metrics by substituting proof of wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb5edd5211dbe4e977030c7230b3bac0
Blockchain protocols implement total-order broadcast in a permissionless setting, where processes can freely join and leave. In such a setting, to safeguard against Sybil attacks, correct processes rely on cryptographic proofs tied to a particular ty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::241c7588176aa81af059da100e32e150
Autor:
Bitansky, Nir, Solomon, Tomer
Homomorphic encryption is a central object in modern cryptography, with far-reaching applications. Constructions supporting homomorphic evaluation of arbitrary Boolean circuits have been known for over a decade, based on standard lattice assumptions.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c20c842cbb5da7ce4a440b51d1ad4033
We consider the task of designing secure computation protocols in an unstable network where honest parties can drop out at any time, according to a schedule provided by the adversary. This type of setting, where even honest parties are prone to failu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d267e4bec923819f5014f2cafe4140d
The bottleneck-complexity (BC) of secure multiparty computation (MPC) protocols is a measure of the maximum number of bits which are sent and received by any party in protocol. As the name suggests, the goal of studying BC-efficient protocols is to i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::832e2f8066dc7f3b8cc21e8f5ac99f5c
Autor:
Rodrigues, Nishant, Lackey, Brad
We derive a device-independent quantum key distribution protocol based on synchronous correlations and their Bell inequalities. This protocol offers several advantages over other device-independent schemes including symmetry between the two users and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43ce88d5f2901bf1f7fe03e8a61657cb
Autor:
Liu, Qipeng
With the power of quantum information, we can achieve exciting and classically impossible cryptographic primitives. However, almost all quantum cryptography faces extreme difficulties with the near-term intermediate-scale quantum technology (NISQ tec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c22f135ad58dc4b0d28d363ee010c14
In the classical model of computation, it is well established that one-way functions (OWF) are minimal for computational cryptography: They are essential for almost any cryptographic application that cannot be realized with respect to computationally
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f777229ffcedf0575c67ae67c1c6607
Interactive Non-Malleable Codes were introduced by Fleischhacker et al. (TCC 2019) in the two party setting with synchronous tampering. The idea of this type of non-malleable code is that it "encodes" an interactive protocol in such a way that, even
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2339d6c28e1a60a1f2f270a934da3d6
Publikováno v:
Journal of Cryptology. 35
Zero-Knowledge PCPs (ZK-PCPs; Kilian, Petrank, and Tardos, STOC `97) are PCPs with the additional zero-knowledge guarantee that the view of any (possibly malicious) verifier making a bounded number of queries to the proof can be efficiently simulated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::069c79b726edbc81f80c3f09f2d73020
https://doi.org/10.1007/s00145-022-09433-3
https://doi.org/10.1007/s00145-022-09433-3
