Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Ben Fisch"'
Publikováno v:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security.
Publikováno v:
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842413
CRYPTO (1)
CRYPTO (1)
Polynomial commitment schemes (PCS) have recently been in the spotlight for their key role in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field and prove its evaluation at points. A succinct PCS has commitment
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2aef18354f5edfab54a876a7fd0c0b0c
https://doi.org/10.1007/978-3-030-84242-0_23
https://doi.org/10.1007/978-3-030-84242-0_23
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457204
EUROCRYPT (1)
EUROCRYPT (1)
We construct a new polynomial commitment scheme for univariate and multivariate polynomials over finite fields, with logarithmic size evaluation proofs and verification time, measured in the number of coefficients of the polynomial. The underlying te
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35df5c0dc49ba6296645a245b821585c
https://doi.org/10.1007/978-3-030-45721-1_24
https://doi.org/10.1007/978-3-030-45721-1_24
Publikováno v:
CCS
We present a new primitive supporting file replication in distributed storage networks (DSNs) called a Public Incompressible Encoding (PIE). PIEs operate in the challenging public DSN setting where files must be encoded and decoded with public random
Publikováno v:
Advances in Cryptology – CRYPTO 2019 ISBN: 9783030269470
CRYPTO (1)
CRYPTO (1)
We present batching techniques for cryptographic accumulators and vector commitments in groups of unknown order. Our techniques are tailored for distributed settings where no trusted accumulator manager exists and updates to the accumulator are proce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce3839b4f3d62012bd3be7b51ab3ff52
https://doi.org/10.1007/978-3-030-26948-7_20
https://doi.org/10.1007/978-3-030-26948-7_20
Autor:
Ben Fisch
Publikováno v:
Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176556
EUROCRYPT (2)
EUROCRYPT (2)
We construct a concretely practical proof-of-space (PoS) with arbitrarily tight security based on stacked depth robust graphs and constant-degree expander graphs. A proof-of-space (PoS) is an interactive proof system where a prover demonstrates that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32f9f502e93393d4924e68c48337d68d
https://doi.org/10.1007/978-3-030-17656-3_12
https://doi.org/10.1007/978-3-030-17656-3_12
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319968834
CRYPTO (1)
CRYPTO (1)
We study the problem of building a verifiable delay function (VDF). A \(\text {VDF}\)requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. \(\text {VDF}\)s have many a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c88cd230809da8ce92171c6356dcb73f
https://doi.org/10.1007/978-3-319-96884-1_25
https://doi.org/10.1007/978-3-319-96884-1_25
Publikováno v:
CCS
Functional encryption (FE) is an extremely powerful cryptographic mechanism that lets an authorized entity compute on encrypted data, and learn the results in the clear. However, all current cryptographic instantiations for general FE are too impract
Publikováno v:
Web and Internet Economics ISBN: 9783319719238
WINE
WINE
Mining for Bitcoins is a high-risk high-reward activity. Miners, seeking to reduce their variance and earn steadier rewards, collaborate in so-called pooling strategies where they jointly mine for Bitcoins. Whenever some pool participant is successfu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74739d2887b448126496f1f001fb9485
https://doi.org/10.1007/978-3-319-71924-5_15
https://doi.org/10.1007/978-3-319-71924-5_15
Publikováno v:
Theory of Cryptography ISBN: 9783662464939
TCC (1)
TCC (1)
In a secure physical computation, a set of parties each have physical inputs and jointly compute a function of their inputs in a way that reveals no information to any party except for the output of the function. Recent work in CRYPTO’14 presented
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd52542e38d9b692477c1e2a6fe57560
https://doi.org/10.1007/978-3-662-46494-6_9
https://doi.org/10.1007/978-3-662-46494-6_9