The Experts below are selected from a list of 87 Experts worldwide ranked by ideXlab platform

Tadanori Teruya - One of the best experts on this subject based on the ideXlab platform.

  • efficient two level homomorphic encryption in prime order bilinear groups and a fast implementation in Webassembly
    Computer and Communications Security, 2018
    Co-Authors: Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya
    Abstract:

    We construct an efficient two-level homomorphic public-key encryption in prime-order bilinear groups. Such a scheme supports polynomially many homomorphic additions and one multiplication over encrypted data, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN, presented at TCC 2005), which was constructed in composite-order bilinear groups. Prior to our work, the state-of-the-art for two-level homomorphic public-key encryption is the Freeman scheme (presented at Eurocrypt 2010), which is indeed the prime-order realization of the BGN scheme. Our proposed scheme significantly improves efficiency for almost all the aspects of the Freeman scheme, while retains the same ciphertext sizes. Our scheme is surprisingly simple as it is indeed (a concatenation of two copies of) the ElGamal encryption "in the exponent'' resided in an asymmetric bilinear groups. We provide a software implementation of our scheme in the x86 architecture. Besides this usual implementation, we also implement our scheme in WebAssembly (wasm), which is a portable low-level bytecode format; this allows our scheme to be run (very fast) on any Popular Web Browser, without any plugins required.

  • AsiaCCS - Efficient Two-level Homomorphic Encryption in Prime-order Bilinear Groups and A Fast Implementation in WebAssembly
    Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018
    Co-Authors: Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya
    Abstract:

    We construct an efficient two-level homomorphic public-key encryption in prime-order bilinear groups. Such a scheme supports polynomially many homomorphic additions and one multiplication over encrypted data, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN, presented at TCC 2005), which was constructed in composite-order bilinear groups. Prior to our work, the state-of-the-art for two-level homomorphic public-key encryption is the Freeman scheme (presented at Eurocrypt 2010), which is indeed the prime-order realization of the BGN scheme. Our proposed scheme significantly improves efficiency for almost all the aspects of the Freeman scheme, while retains the same ciphertext sizes. Our scheme is surprisingly simple as it is indeed (a concatenation of two copies of) the ElGamal encryption "in the exponent'' resided in an asymmetric bilinear groups. We provide a software implementation of our scheme in the x86 architecture. Besides this usual implementation, we also implement our scheme in WebAssembly (wasm), which is a portable low-level bytecode format; this allows our scheme to be run (very fast) on any Popular Web Browser, without any plugins required.

Armando Stellato - One of the best experts on this subject based on the ideXlab platform.

  • WebIST (2) - SEMANTIC TURKEY - A New Web Experience in between Ontology Editing and Semantic Annotation
    2008
    Co-Authors: Francesca Fallucchi, Maria Teresa Pazienza, Noemi Scarpato, Armando Stellato
    Abstract:

    In this work we describe Semantic Turkey, a Semantic Extension for the Popular Web Browser Mozilla Firefox. Semantic Turkey can be used to keep track of relevant information from visited Web sites and organize collected content according to a personally defined ontology. In this sense, Semantic Turkey can be seen both as an advanced semantic bookmarking system as well as an ontology editing assistant, which allows domain experts and ontology developers to build ontologies starting from the very raw source of information which they find on the Web. The open architecture of Semantic Turkey and the specific three-layered approach of its design also allows for scaling the basic personal desktop application embodied by this tool up to a distributed framework for collaborative semantic annotation and ontology editing. This paper describes the architecture and the functionalities of the Semantic Turkey extension for Firefox, and describe possible evolutions for future improvement of the tool.

  • ESWC - Semantic Turkey: A Semantic Bookmarking Tool (System Description)
    Lecture Notes in Computer Science, 2007
    Co-Authors: Donato Griesi, Maria Teresa Pazienza, Armando Stellato
    Abstract:

    In this work we introduce Semantic Turkey, a Semantic Extension for the Popular Web Browser Mozilla Firefox. Semantic Turkey can be used to keep track of relevant information from visited Web sites and organize collected content according to a personally defined ontology. Clear separation between knowledge data (the WHAT) and Web links (the WHERE) is established into the knowledge model of the system, which allows for innovative navigation of both the acquired information and of the pages where it has been collected. This paper describes the architecture of the Semantic Turkey extension for Firefox, analyzes its development, shows its most interesting features and presents our plans for future improvements of the tool.

  • SWAP - Gobbleing over the Web with semantic turkey
    2006
    Co-Authors: Donato Griesi, Maria Teresa Pazienza, Armando Stellato
    Abstract:

    In this work we introduce Semantic Turkey, a Semantic Extension for the Popular Web Browser Mozilla Firefox. Semantic Turkey can be used to annotate information from visited Web sites and organize this information according to a personally defined ontology. Clear separation between knowledge data (the WHAT) and Web links (the WHERE) is established into the knowledge model of the system, which allows for innovative navigation of the acquired information and of the pages where it has been collected. This paper describes the architecture of the Semantic Turkey extension for Firefox, discusses its development in the context of the FILAS technophore project, shows its most interesting features and presents our plans for future improvements of the tool.

Nuttapong Attrapadung - One of the best experts on this subject based on the ideXlab platform.

  • efficient two level homomorphic encryption in prime order bilinear groups and a fast implementation in Webassembly
    Computer and Communications Security, 2018
    Co-Authors: Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya
    Abstract:

    We construct an efficient two-level homomorphic public-key encryption in prime-order bilinear groups. Such a scheme supports polynomially many homomorphic additions and one multiplication over encrypted data, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN, presented at TCC 2005), which was constructed in composite-order bilinear groups. Prior to our work, the state-of-the-art for two-level homomorphic public-key encryption is the Freeman scheme (presented at Eurocrypt 2010), which is indeed the prime-order realization of the BGN scheme. Our proposed scheme significantly improves efficiency for almost all the aspects of the Freeman scheme, while retains the same ciphertext sizes. Our scheme is surprisingly simple as it is indeed (a concatenation of two copies of) the ElGamal encryption "in the exponent'' resided in an asymmetric bilinear groups. We provide a software implementation of our scheme in the x86 architecture. Besides this usual implementation, we also implement our scheme in WebAssembly (wasm), which is a portable low-level bytecode format; this allows our scheme to be run (very fast) on any Popular Web Browser, without any plugins required.

  • AsiaCCS - Efficient Two-level Homomorphic Encryption in Prime-order Bilinear Groups and A Fast Implementation in WebAssembly
    Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018
    Co-Authors: Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya
    Abstract:

    We construct an efficient two-level homomorphic public-key encryption in prime-order bilinear groups. Such a scheme supports polynomially many homomorphic additions and one multiplication over encrypted data, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN, presented at TCC 2005), which was constructed in composite-order bilinear groups. Prior to our work, the state-of-the-art for two-level homomorphic public-key encryption is the Freeman scheme (presented at Eurocrypt 2010), which is indeed the prime-order realization of the BGN scheme. Our proposed scheme significantly improves efficiency for almost all the aspects of the Freeman scheme, while retains the same ciphertext sizes. Our scheme is surprisingly simple as it is indeed (a concatenation of two copies of) the ElGamal encryption "in the exponent'' resided in an asymmetric bilinear groups. We provide a software implementation of our scheme in the x86 architecture. Besides this usual implementation, we also implement our scheme in WebAssembly (wasm), which is a portable low-level bytecode format; this allows our scheme to be run (very fast) on any Popular Web Browser, without any plugins required.

Shigeo Mitsunari - One of the best experts on this subject based on the ideXlab platform.

  • efficient two level homomorphic encryption in prime order bilinear groups and a fast implementation in Webassembly
    Computer and Communications Security, 2018
    Co-Authors: Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya
    Abstract:

    We construct an efficient two-level homomorphic public-key encryption in prime-order bilinear groups. Such a scheme supports polynomially many homomorphic additions and one multiplication over encrypted data, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN, presented at TCC 2005), which was constructed in composite-order bilinear groups. Prior to our work, the state-of-the-art for two-level homomorphic public-key encryption is the Freeman scheme (presented at Eurocrypt 2010), which is indeed the prime-order realization of the BGN scheme. Our proposed scheme significantly improves efficiency for almost all the aspects of the Freeman scheme, while retains the same ciphertext sizes. Our scheme is surprisingly simple as it is indeed (a concatenation of two copies of) the ElGamal encryption "in the exponent'' resided in an asymmetric bilinear groups. We provide a software implementation of our scheme in the x86 architecture. Besides this usual implementation, we also implement our scheme in WebAssembly (wasm), which is a portable low-level bytecode format; this allows our scheme to be run (very fast) on any Popular Web Browser, without any plugins required.

  • AsiaCCS - Efficient Two-level Homomorphic Encryption in Prime-order Bilinear Groups and A Fast Implementation in WebAssembly
    Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018
    Co-Authors: Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya
    Abstract:

    We construct an efficient two-level homomorphic public-key encryption in prime-order bilinear groups. Such a scheme supports polynomially many homomorphic additions and one multiplication over encrypted data, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN, presented at TCC 2005), which was constructed in composite-order bilinear groups. Prior to our work, the state-of-the-art for two-level homomorphic public-key encryption is the Freeman scheme (presented at Eurocrypt 2010), which is indeed the prime-order realization of the BGN scheme. Our proposed scheme significantly improves efficiency for almost all the aspects of the Freeman scheme, while retains the same ciphertext sizes. Our scheme is surprisingly simple as it is indeed (a concatenation of two copies of) the ElGamal encryption "in the exponent'' resided in an asymmetric bilinear groups. We provide a software implementation of our scheme in the x86 architecture. Besides this usual implementation, we also implement our scheme in WebAssembly (wasm), which is a portable low-level bytecode format; this allows our scheme to be run (very fast) on any Popular Web Browser, without any plugins required.

Kana Shimizu - One of the best experts on this subject based on the ideXlab platform.

  • efficient two level homomorphic encryption in prime order bilinear groups and a fast implementation in Webassembly
    Computer and Communications Security, 2018
    Co-Authors: Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya
    Abstract:

    We construct an efficient two-level homomorphic public-key encryption in prime-order bilinear groups. Such a scheme supports polynomially many homomorphic additions and one multiplication over encrypted data, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN, presented at TCC 2005), which was constructed in composite-order bilinear groups. Prior to our work, the state-of-the-art for two-level homomorphic public-key encryption is the Freeman scheme (presented at Eurocrypt 2010), which is indeed the prime-order realization of the BGN scheme. Our proposed scheme significantly improves efficiency for almost all the aspects of the Freeman scheme, while retains the same ciphertext sizes. Our scheme is surprisingly simple as it is indeed (a concatenation of two copies of) the ElGamal encryption "in the exponent'' resided in an asymmetric bilinear groups. We provide a software implementation of our scheme in the x86 architecture. Besides this usual implementation, we also implement our scheme in WebAssembly (wasm), which is a portable low-level bytecode format; this allows our scheme to be run (very fast) on any Popular Web Browser, without any plugins required.

  • AsiaCCS - Efficient Two-level Homomorphic Encryption in Prime-order Bilinear Groups and A Fast Implementation in WebAssembly
    Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018
    Co-Authors: Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya
    Abstract:

    We construct an efficient two-level homomorphic public-key encryption in prime-order bilinear groups. Such a scheme supports polynomially many homomorphic additions and one multiplication over encrypted data, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN, presented at TCC 2005), which was constructed in composite-order bilinear groups. Prior to our work, the state-of-the-art for two-level homomorphic public-key encryption is the Freeman scheme (presented at Eurocrypt 2010), which is indeed the prime-order realization of the BGN scheme. Our proposed scheme significantly improves efficiency for almost all the aspects of the Freeman scheme, while retains the same ciphertext sizes. Our scheme is surprisingly simple as it is indeed (a concatenation of two copies of) the ElGamal encryption "in the exponent'' resided in an asymmetric bilinear groups. We provide a software implementation of our scheme in the x86 architecture. Besides this usual implementation, we also implement our scheme in WebAssembly (wasm), which is a portable low-level bytecode format; this allows our scheme to be run (very fast) on any Popular Web Browser, without any plugins required.