Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Fleischhacker, Nils"'
In this work we study Invertible Bloom Lookup Tables (IBLTs) with small failure probabilities. IBLTs are highly versatile data structures that have found applications in set reconciliation protocols, error-correcting codes, and even the design of adv
Externí odkaz:
http://arxiv.org/abs/2306.07583
Property-preserving hash functions allow for compressing long inputs $x_0$ and $x_1$ into short hashes $h(x_0)$ and $h(x_1)$ in a manner that allows for computing a predicate $P(x_0, x_1)$ given only the two hash values without having access to the o
Externí odkaz:
http://arxiv.org/abs/2106.06453
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:
Fleischhacker, N, Larsen, K G & Simkin, M 2022, Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions . in O Dunkelman & S Dziembowski (eds), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings . Springer, Lecture Notes in Computer Science (LNCS), vol. 13276, pp. 764-781, 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022, Trondheim, Norway, 30/05/2022 . https://doi.org/10.1007/978-3-031-07085-3_26
Property-preserving hash functions allow for compressing long inputs x0 and x1 into short hashes h(x0) and h(x1) in a manner that allows for computing a predicate P(x0, x1) given only the two hash values without having access to the original data. Su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::caad83c29523733a56381a5c231558fa
https://pure.au.dk/portal/da/publications/propertypreserving-hash-functions-for-hamming-distance-from-standard-assumptions(72620544-211d-4c83-8dfe-7f285c9c76ef).html
https://pure.au.dk/portal/da/publications/propertypreserving-hash-functions-for-hamming-distance-from-standard-assumptions(72620544-211d-4c83-8dfe-7f285c9c76ef).html
Autor:
Fleischhacker, Nils, Simkin, Mark
Publikováno v:
Fleischhacker, N & Simkin, M 2021, On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments . in J A Garay (ed.), Public-Key Cryptography – PKC 2021 : 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10–13, 2021, Proceedings, Part II . Springer, Lecture Notes in Computer Science, vol. LNCS 12711, pp. 618-648, 24th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2021, Virtual, Online, 10/05/2021 . https://doi.org/10.1007/978-3-030-75248-4_22
Constructing interactive zero-knowledge arguments from simple assumptions with small communication complexity and good computational efficiency is an important, but difficult problem. In this work, we study interactive arguments with noticeable sound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::63afc448f041e4e2a0b1d670d8df919d
https://pure.au.dk/portal/da/publications/on-publiclyaccountable-zeroknowledge-and-small-shuffle-arguments(5ad8a8bf-799a-415a-a487-fd5486597342).html
https://pure.au.dk/portal/da/publications/on-publiclyaccountable-zeroknowledge-and-small-shuffle-arguments(5ad8a8bf-799a-415a-a487-fd5486597342).html
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Fleischhacker, Nils
Virtually all of modern cryptography relies on unproven assumptions. This is necessary, as the existence of cryptography would have wide ranging implications. In particular, it would hold that P =/= NP, which is not known to be true. Nevertheless, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d6195c2ad2b64f5d0d404e44d563c37
Autor:
Fleischhacker, Nils, Krupp, Johannes, Malavolta, Giulio, Schneider, Jonas, Schröder, Dominique, Simkin, Mark
Publikováno v:
Public-Key Cryptography - PKC 2016: 19th IACR International Conference on Practice & Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part I; 2016, p301-330, 30p
