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

David Kaeli - One of the best experts on this subject based on the ideXlab platform.

  • ICCAD - Effective simple-power analysis attacks of elliptic curve cryptography on embedded systems
    Proceedings of the International Conference on Computer-Aided Design - ICCAD '18, 2018
    Co-Authors: Chao Luo, Yunsi Fei, David Kaeli
    Abstract:

    Elliptic Curve Cryptography (ECC), initially proposed by Koblitz [17] and Miller [20], is a Public-Key Cipher. Compared with other popular Public-Key Ciphers (e.g., RSA), ECC features a shorter Key length for the same level of security. For example, a 256-bit ECC Cipher provides 128-bit security, equivalent to a 2048-bit RSA Cipher [4]. Using smaller Keys, ECC requires less memory for performing cryptographic operations. Embedded systems, especially given the proliferation of Internet-of-Things (IoT) devices and platforms, require efficient and low-power secure communications between edge devices and gateways/clouds. ECC has been widely adopted in IoT systems for authentication of communications, while RSA, which is much more costly to compute, remains the standard for desktops and servers.

  • ICCAD - GPU acceleration of RSA is vulnerable to side-channel timing attacks
    Proceedings of the International Conference on Computer-Aided Design, 2018
    Co-Authors: David Kaeli
    Abstract:

    The RSA algorithm [21] is a Public-Key Cipher widely used in digital signatures and Internet protocols, including the Security Socket Layer (SSL) and Transport Layer Security (TLS). RSA entails excessive computational complexity compared with symmetric Ciphers. For scenarios where an Internet domain is handling a large number of SSL connections and generating digital signatures for a large number of files, the amount of RSA computation becomes a major performance bottleneck. With the advent of general-purpose GPUs, the performance of RSA has been improved significantly by exploiting parallel computing on a GPU [9], [18], [23], [26], leveraging the Single Instruction Multiple Thread (SIMT) model.

  • GPU Acceleration of RSA is Vulnerable to Side-channel Timing Attacks
    2018 IEEE ACM International Conference on Computer-Aided Design (ICCAD), 2018
    Co-Authors: David Kaeli
    Abstract:

    The RSA algorithm [21] is a Public-Key Cipher widely used in digital signatures and Internet protocols, including the Security Socket Layer (SSL) and Transport Layer Security (TLS). RSA entails excessive computational complexity compared with symmetric Ciphers. For scenarios where an Internet domain is handling a large number of SSL connections and generating digital signatures for a large number of files, the amount of RSA computation becomes a major performance bottleneck. With the advent of general-purpose GPUs, the performance of RSA has been improved significantly by exploiting parallel computing on a GPU [9], [18], [23], [26], leveraging the Single Instruction Multiple Thread (SIMT) model.

  • Effective Simple-Power Analysis Attacks of Elliptic Curve Cryptography on Embedded Systems
    2018 IEEE ACM International Conference on Computer-Aided Design (ICCAD), 2018
    Co-Authors: David Kaeli
    Abstract:

    Elliptic Curve Cryptography (ECC), initially proposed by Koblitz [17] and Miller [20], is a Public-Key Cipher. Compared with other popular Public-Key Ciphers (e.g., RSA), ECC features a shorter Key length for the same level of security. For example, a 256-bit ECC Cipher provides 128-bit security, equivalent to a 2048-bit RSA Cipher [4]. Using smaller Keys, ECC requires less memory for performing cryptographic operations. Embedded systems, especially given the proliferation of Internet-of-Things (IoT) devices and platforms, require efficient and low-power secure communications between edge devices and gateways/clouds. ECC has been widely adopted in IoT systems for authentication of communications, while RSA, which is much more costly to compute, remains the standard for desktops and servers.

Martijn Maas - One of the best experts on this subject based on the ideXlab platform.

  • A Buyer–Seller Watermarking Protocol Based on Secure Embedding
    Information Forensics and Security, IEEE Transactions on, 2008
    Co-Authors: Stefan Katzenbeisser, A. Lemma, MINNE VAN DER VEEN, Mehmet Utku Celik, Martijn Maas
    Abstract:

    In a forensic watermarking architecture, a buyer-seller protocol protects the watermark secrets from the buyer and prevents false infringement accusations by the seller. Existing protocols encrypt the watermark and the content with a homomorphic Public-Key Cipher and perform embedding under encryption. When used for multimedia data, these protocols create a large computation and bandwidth overhead. In this correspondence, we show that the same functionality can be achieved efficiently using recently proposed secure watermark embedding algorithms.

  • A Buyer–Seller Watermarking Protocol Based on Secure Embedding
    IEEE Transactions on Information Forensics and Security, 2008
    Co-Authors: Stefan Katzenbeisser, A. Lemma, Mehmet Utku Celik, Michiel Van Der Veen, Martijn Maas
    Abstract:

    In a forensic watermarking architecture, a buyer-seller protocol protects the watermark secrets from the buyer and prevents false infringement accusations by the seller. Existing protocols encrypt the watermark and the content with a homomorphic Public-Key Cipher and perform embedding under encryption. When used for multimedia data, these protocols create a large computation and bandwidth overhead. In this correspondence, we show that the same functionality can be achieved efficiently using recently proposed secure watermark embedding algorithms.

Stefan Katzenbeisser - One of the best experts on this subject based on the ideXlab platform.

  • A Buyer–Seller Watermarking Protocol Based on Secure Embedding
    Information Forensics and Security, IEEE Transactions on, 2008
    Co-Authors: Stefan Katzenbeisser, A. Lemma, MINNE VAN DER VEEN, Mehmet Utku Celik, Martijn Maas
    Abstract:

    In a forensic watermarking architecture, a buyer-seller protocol protects the watermark secrets from the buyer and prevents false infringement accusations by the seller. Existing protocols encrypt the watermark and the content with a homomorphic Public-Key Cipher and perform embedding under encryption. When used for multimedia data, these protocols create a large computation and bandwidth overhead. In this correspondence, we show that the same functionality can be achieved efficiently using recently proposed secure watermark embedding algorithms.

  • A Buyer–Seller Watermarking Protocol Based on Secure Embedding
    IEEE Transactions on Information Forensics and Security, 2008
    Co-Authors: Stefan Katzenbeisser, A. Lemma, Mehmet Utku Celik, Michiel Van Der Veen, Martijn Maas
    Abstract:

    In a forensic watermarking architecture, a buyer-seller protocol protects the watermark secrets from the buyer and prevents false infringement accusations by the seller. Existing protocols encrypt the watermark and the content with a homomorphic Public-Key Cipher and perform embedding under encryption. When used for multimedia data, these protocols create a large computation and bandwidth overhead. In this correspondence, we show that the same functionality can be achieved efficiently using recently proposed secure watermark embedding algorithms.

A. Lemma - One of the best experts on this subject based on the ideXlab platform.

  • A Buyer–Seller Watermarking Protocol Based on Secure Embedding
    Information Forensics and Security, IEEE Transactions on, 2008
    Co-Authors: Stefan Katzenbeisser, A. Lemma, MINNE VAN DER VEEN, Mehmet Utku Celik, Martijn Maas
    Abstract:

    In a forensic watermarking architecture, a buyer-seller protocol protects the watermark secrets from the buyer and prevents false infringement accusations by the seller. Existing protocols encrypt the watermark and the content with a homomorphic Public-Key Cipher and perform embedding under encryption. When used for multimedia data, these protocols create a large computation and bandwidth overhead. In this correspondence, we show that the same functionality can be achieved efficiently using recently proposed secure watermark embedding algorithms.

  • A Buyer–Seller Watermarking Protocol Based on Secure Embedding
    IEEE Transactions on Information Forensics and Security, 2008
    Co-Authors: Stefan Katzenbeisser, A. Lemma, Mehmet Utku Celik, Michiel Van Der Veen, Martijn Maas
    Abstract:

    In a forensic watermarking architecture, a buyer-seller protocol protects the watermark secrets from the buyer and prevents false infringement accusations by the seller. Existing protocols encrypt the watermark and the content with a homomorphic Public-Key Cipher and perform embedding under encryption. When used for multimedia data, these protocols create a large computation and bandwidth overhead. In this correspondence, we show that the same functionality can be achieved efficiently using recently proposed secure watermark embedding algorithms.

Mehmet Utku Celik - One of the best experts on this subject based on the ideXlab platform.

  • A Buyer–Seller Watermarking Protocol Based on Secure Embedding
    Information Forensics and Security, IEEE Transactions on, 2008
    Co-Authors: Stefan Katzenbeisser, A. Lemma, MINNE VAN DER VEEN, Mehmet Utku Celik, Martijn Maas
    Abstract:

    In a forensic watermarking architecture, a buyer-seller protocol protects the watermark secrets from the buyer and prevents false infringement accusations by the seller. Existing protocols encrypt the watermark and the content with a homomorphic Public-Key Cipher and perform embedding under encryption. When used for multimedia data, these protocols create a large computation and bandwidth overhead. In this correspondence, we show that the same functionality can be achieved efficiently using recently proposed secure watermark embedding algorithms.

  • A Buyer–Seller Watermarking Protocol Based on Secure Embedding
    IEEE Transactions on Information Forensics and Security, 2008
    Co-Authors: Stefan Katzenbeisser, A. Lemma, Mehmet Utku Celik, Michiel Van Der Veen, Martijn Maas
    Abstract:

    In a forensic watermarking architecture, a buyer-seller protocol protects the watermark secrets from the buyer and prevents false infringement accusations by the seller. Existing protocols encrypt the watermark and the content with a homomorphic Public-Key Cipher and perform embedding under encryption. When used for multimedia data, these protocols create a large computation and bandwidth overhead. In this correspondence, we show that the same functionality can be achieved efficiently using recently proposed secure watermark embedding algorithms.