Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Yarkin Doröz"'
Autor:
Berk Sunar, Yarkin Doröz
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 66-83 (2020)
We propose a new FHE scheme F-NTRU that adopts the flattening technique proposed in GSW to derive an NTRU based scheme that (similar to GSW) does not require evaluation keys or key switching. Our scheme eliminates the decision small polynomial ratio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5cc7940465b668f4c7022493efe09cc
https://doi.org/10.1515/jmc-2015-0052
https://doi.org/10.1515/jmc-2015-0052
Publikováno v:
Designs, Codes and Cryptography. 80:333-358
Since its introduction more than a decade ago the homomorphic properties of the NTRU encryption scheme have gone largely ignored. A variant of NTRU proposed by Stehle and Steinfeld was recently extended into a full fledged multi-key fully homomorphic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0350165bcf49b7d3edfee6a786e954e
https://doi.org/10.1007/s10623-015-0095-1
https://doi.org/10.1007/s10623-015-0095-1
Autor:
Jill Pipher, Joseph H. Silverman, William Whyte, Zhenfei Zhang, Berk Sunar, Jeffrey Hoffstein, Yarkin Doröz
Publikováno v:
Public-Key Cryptography – PKC 2018 ISBN: 9783319765778
Public Key Cryptography (1)
Public Key Cryptography (1)
If q is a prime and n is a positive integer then any two finite fields of order \(q^n\) are isomorphic. Elements of these fields can be thought of as polynomials with coefficients chosen modulo q, and a notion of length can be associated to these pol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7dfad1386c6bb96e9b80a208fc7f990
https://doi.org/10.1007/978-3-319-76578-5_5
https://doi.org/10.1007/978-3-319-76578-5_5
Publikováno v:
Microprocessors and Microsystems. 38:766-775
In this work we present a full and complete evaluation of a very large multiplication scheme in custom hardware. We designed a novel architecture to realize a million-bit multiplication scheme based on the Schönhage-Strassen Algorithm. We constructe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d36cd196822d4002826d9cfd6ab0dc21
https://doi.org/10.1016/j.micpro.2014.06.003
https://doi.org/10.1016/j.micpro.2014.06.003
After the introduction of first fully homomorphic encryption scheme in 2009, numerous research work has been published aiming at making fully homomorphic encryption practical for daily use. The first fully functional scheme and a few others that have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fbb4d0d1e823c0f866de19562a0f963
https://aperta.ulakbim.gov.tr/record/44877
https://aperta.ulakbim.gov.tr/record/44877
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783662533567
Financial Cryptography Workshops
Financial Cryptography Workshops
We introduce a homomorphic batching technique that can be used to pack multiple ciphertext messages into one ciphertext for parallel processing. One is able to use the method to batch or unbatch messages homomorphically to further improve the flexibi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe0c1b768ac49c792fd21e6e6a879707
https://doi.org/10.1007/978-3-662-53357-4_19
https://doi.org/10.1007/978-3-662-53357-4_19
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662483237
CHES
CHES
International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2015 -- 13 September 2015 through 16 September 2015 -- -- 140709 After being introduced in 2009, the first fully homomorphic encryption (FHE) scheme has created significant e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc22770149a541679348e6c7a53bebfe
Publikováno v:
Progress in Cryptology--LATINCRYPT 2015 ISBN: 9783319221731
LATINCRYPT
LATINCRYPT
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is obtained by focusing on the multiplicative depth of the sorting circuit alongside the more traditional metrics such as numbe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9f9f7309399d1c1b810f5d8868fa800
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783662480502
Financial Cryptography Workshops
Financial Cryptography Workshops
In this work we focus on tailoring and optimizing the computational Private Information Retrieval (cPIR) scheme proposed in WAHC 2014 for efficient execution on graphics processing units (GPUs). Exploiting the mass parallelism in GPUs is a commonly u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68fa4e2170f9a17508bc1ff0633bc6da
https://doi.org/10.1007/978-3-662-48051-9_12
https://doi.org/10.1007/978-3-662-48051-9_12
Publikováno v:
HPEC
We introduce a large polynomial arithmetic library optimized for Nvidia GPUs to support fully homomorphic encryption schemes. To realize the large polynomial arithmetic library we convert polynomials with large coefficients using the Chinese Remainde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c5f6d85c1b0094a11363a6a8a5ec638
https://doi.org/10.1109/hpec.2014.7041001
https://doi.org/10.1109/hpec.2014.7041001