Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Mukul Kulkarni"'
Publikováno v:
Designs, Codes and Cryptography. 91:497-544
In this paper, we study code-based signatures constructed from Proof of Knowledge (PoK). This line of work can be traced back to Stern who introduces the first efficient PoK for the syndrome decoding problem in 1993. Afterward, different variations w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36f6befcb6d55c1edd309822610fa104
https://doi.org/10.1007/s10623-022-01114-3
https://doi.org/10.1007/s10623-022-01114-3
Publikováno v:
Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 72-86 (2020)
We initiate the study of partial key exposure in Ring-LWE (RLWE)-based cryptosystems. Specifically, we (1) Introduce the search and decision Leaky R-LWE assumptions (Leaky R-SLWE, Leaky R-DLWE), to formalize the hardness of search/decision RLWE under
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f14b1c04c42dd827ff45573e24035beb
https://doi.org/10.1515/jmc-2020-0075
https://doi.org/10.1515/jmc-2020-0075
Publikováno v:
Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 87-110 (2020)
The leftover hash lemma (LHL) is used in the analysis of various lattice-based cryptosystems, such as the Regev and Dual-Regev encryption schemes as well as their leakage-resilient counterparts. The LHL does not hold in the ring setting, when the rin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d15a9e0b892eaeca545714d8049cd39
https://doaj.org/article/467baf174cdd4e4ab555c1f45904077f
https://doaj.org/article/467baf174cdd4e4ab555c1f45904077f
Publikováno v:
Proceedings on Privacy Enhancing Technologies, Vol 2020, Iss 3, Pp 153-174 (2020)
We consider a scenario where multiple organizations holding large amounts of sensitive data from their users wish to compute aggregate statistics on this data while protecting the privacy of individual users. To support large-scale analytics we inves
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c85ff7ebc4f55db1e593013ea6f20a79
https://doi.org/10.2478/popets-2020-0047
https://doi.org/10.2478/popets-2020-0047
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783030587475
Recently, the work of Bolboceanu et al. (Asiacrypt ’19) and the work of Dachman Soled et al. (Mathcrypt ’19) have studied a leakage model that assumes leakage of some fraction of the NTT coordinates of the secret key in RLWE cryptosystems (or equ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b386e417c2c5b4b564fe29c7193112ab
https://doi.org/10.1007/978-3-030-58748-2_6
https://doi.org/10.1007/978-3-030-58748-2_6
Publikováno v:
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568764
CRYPTO (3)
CRYPTO (3)
We present a transformation from NIZK with inefficient provers in the uniform random string (URS) model to ZAPs (two message witness indistinguishable proofs) with inefficient provers. While such a transformation was known for the case where the prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afbf1a29e2221003b3109fafa5195c3c
https://doi.org/10.1007/978-3-030-56877-1_24
https://doi.org/10.1007/978-3-030-56877-1_24
Autor:
Mukul Kulkarni, Dana Dachman-Soled
Publikováno v:
Public-Key Cryptography – PKC 2019 ISBN: 9783030172527
Public Key Cryptography (1)
Public Key Cryptography (1)
Recently, Faust et al. (TCC’14) introduced the notion of continuous non-malleable codes (CNMC), which provides stronger security guarantees than standard non-malleable codes, by allowing an adversary to tamper with the codeword in a continuous way
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5eef5d545727d45c4e7214d7522ae9ab
https://doi.org/10.1007/978-3-030-17253-4_18
https://doi.org/10.1007/978-3-030-17253-4_18
Publikováno v:
Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176525
EUROCRYPT (1)
EUROCRYPT (1)
We construct efficient non-malleable codes (NMC) that are (computationally) secure against tampering by functions computable in any fixed polynomial time. Our construction is in the plain (no-CRS) model and requires the assumptions that (1) \(\mathbf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17fb7379f13967ddab196ef63083e4e8
https://doi.org/10.1007/978-3-030-17653-2_17
https://doi.org/10.1007/978-3-030-17653-2_17
Publikováno v:
Public-Key Cryptography – PKC 2018 ISBN: 9783319765808
Public Key Cryptography (2)
Public Key Cryptography (2)
In a recent result, Dachman-Soled et al. (TCC ’15) proposed a new notion called locally decodable and updatable non-malleable codes, which informally, provides the security guarantees of a non-malleable code while also allowing for efficient random
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01d82526a2cb3a7c8d38e23c668ed311
https://doi.org/10.1007/978-3-319-76581-5_10
https://doi.org/10.1007/978-3-319-76581-5_10
Publikováno v:
Advances in Cryptology – EUROCRYPT 2018 ISBN: 9783319783710
EUROCRYPT (3)
EUROCRYPT (3)
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm such that to protect against tampering in a class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::965eb41bd24f7cc8dd92d95a875bef7a
https://doi.org/10.1007/978-3-319-78372-7_20
https://doi.org/10.1007/978-3-319-78372-7_20