Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Kulkarni Mukul"'
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://doaj.org/article/49908486d3e640a0a8b89c975baac695
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://doaj.org/article/467baf174cdd4e4ab555c1f45904077f
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:
http://arxiv.org/abs/2201.05403
The ongoing NIST standardization process has shown that Proof of Knowledge (PoK) based signatures have become an important type of possible post-quantum signatures. Regarding code-based cryptography, the original approach for PoK based signatures is
Externí odkaz:
http://arxiv.org/abs/2110.05005
Autor:
Bettaieb, Slim, Bidoux, Loïc, Dyseryn, Victor, Esser, Andre, Gaborit, Philippe, Kulkarni, Mukul, Palumbi, Marco
Publikováno v:
Designs, Codes & Cryptography; Aug2024, Vol. 92 Issue 8, p2131-2157, 27p
Publikováno v:
In Information and Computation October 2019 268
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.
There have been many successes in constructing explicit non-malleable codes for various classes of tampering functions in recent years, and strong existential results are also known. In this work we ask the following question: When can we rule out th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe2249a6ce234567292a05c3386b9064
Autor:
Kulkarni, Mukul
Modern cryptographic systems provide provable security guarantees as long as secret keys of the system remain confidential. However, if adversary learns some bits of information about the secret keys the security of the system can be breached. Side-c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f8546afb92e4ff4b413bf32107c9909
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.