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

Moni Naor - One of the best experts on this subject based on the ideXlab platform.

  • cryptography and game theory designing protocols for exchanging information
    Theory of Cryptography Conference, 2008
    Co-Authors: Gillat Kol, Moni Naor
    Abstract:

    The goal of this paper is finding fair protocols for the secret sharing and secure multiparty computation (SMPC) problems, when players are assumed to be rational. It was observed by Halpern and Teague (STOC 2004) that protocols with bounded number of iterations are susceptible to backward induction and cannot be considered rational. Previously suggested cryptographic solutions all share the property of having an essential exponential upper bound on their running time, and hence they are also susceptible to backward induction. Although it seems that this bound is an inherent property of every cryptography based solution, we show that this is not the case. We suggest coalition-resilient secret sharing and SMPC protocols with the property that after any sequence of iterations it is still a computational best response to follow them. Therefore, the protocols can be run any number of iterations, and are immune to backward induction. The Mean of Communication assumed is a broadcast channel, and we consider both the simultaneous and non-simultaneous cases.

  • TCC - Cryptography and game theory: designing protocols for exchanging information
    Theory of Cryptography, 1
    Co-Authors: Gillat Kol, Moni Naor
    Abstract:

    The goal of this paper is finding fair protocols for the secret sharing and secure multiparty computation (SMPC) problems, when players are assumed to be rational. It was observed by Halpern and Teague (STOC 2004) that protocols with bounded number of iterations are susceptible to backward induction and cannot be considered rational. Previously suggested cryptographic solutions all share the property of having an essential exponential upper bound on their running time, and hence they are also susceptible to backward induction. Although it seems that this bound is an inherent property of every cryptography based solution, we show that this is not the case. We suggest coalition-resilient secret sharing and SMPC protocols with the property that after any sequence of iterations it is still a computational best response to follow them. Therefore, the protocols can be run any number of iterations, and are immune to backward induction. The Mean of Communication assumed is a broadcast channel, and we consider both the simultaneous and non-simultaneous cases.

Pasquale Savino - One of the best experts on this subject based on the ideXlab platform.

  • Intelligent Search on XML Data - The Use of XML in a Video Digital Library
    Lecture Notes in Computer Science, 2003
    Co-Authors: Claudio Gennaro, Fausto Rabitti, Pasquale Savino
    Abstract:

    Video can be considered today as a primarily Mean of Communication, due to its richness in informative content and to its appeal. Indeed, the combination of audio and video is an extremely important Communication channel: it is considered that approximately 50% of what is seen and heard simultaneously is retained. Due to all these considerations, audio/video is particularly important in many different application sectors, such as TV broadcasting, professional applications (e.g. medicine, journalism, advertising, education, etc.), movie production, historical video archives. Furthermore, most of the video material produced is extremely difficult to access, due to several limitations: video documents are extremely large in size, so that archiving and transmission are expensive; video document’s content, even if extremely rich, is difficult to extract in order to support an effective content-based retrieval.

Juan C. Moreno-cabrera - One of the best experts on this subject based on the ideXlab platform.

  • Speech and gesture: an integrational approach
    Language Sciences, 2011
    Co-Authors: Juan C. Moreno-cabrera
    Abstract:

    In this paper, gestures accompanying speech are considered as an integral part of human linguistic Communication. It is shown that gestures and speech are functionally convergent: they can be used to fulfill the same linguistic functions in conversation. Then the gestural nature of speech is argued for: since oral gestures produce speech, it can be maintained that speech is also a gestural Mean of Communication. It is also shown that non-verbal gestures can also take part in the structure of verbal sentences as constituent components playing a regular syntactic role. All these phenomena can be used to argue in favor of an integrational view of human language, in the line of that proposed by Harris.

Christophe Choquet - One of the best experts on this subject based on the ideXlab platform.

  • ICALT - Operationalization of Learning Scenarios on Open and Distance Learning Platforms: The Case of the Moodle Platform
    2011 IEEE 11th International Conference on Advanced Learning Technologies, 2011
    Co-Authors: Aymen Abedmouleh, Lahcen Oubahssi, Pierre Laforcade, Christophe Choquet
    Abstract:

    This paper aims to facilitate the operationalization of scenarios on learning platforms. We propose an approach based on the explicitation and the formalization of the implicit business language in order to use it as a Mean of Communication with external design tools without losing the semantic of the designed scenario. The originality of our approach relies in performing the scenarios operationalization by the development of a simple API based on the implicit language of the platform. Our proposal is based on a theoretical framework inspired from the Domain Specific Modeling. Finally, we detail the implementation of our proposal on MOODLE.

Gillat Kol - One of the best experts on this subject based on the ideXlab platform.

  • cryptography and game theory designing protocols for exchanging information
    Theory of Cryptography Conference, 2008
    Co-Authors: Gillat Kol, Moni Naor
    Abstract:

    The goal of this paper is finding fair protocols for the secret sharing and secure multiparty computation (SMPC) problems, when players are assumed to be rational. It was observed by Halpern and Teague (STOC 2004) that protocols with bounded number of iterations are susceptible to backward induction and cannot be considered rational. Previously suggested cryptographic solutions all share the property of having an essential exponential upper bound on their running time, and hence they are also susceptible to backward induction. Although it seems that this bound is an inherent property of every cryptography based solution, we show that this is not the case. We suggest coalition-resilient secret sharing and SMPC protocols with the property that after any sequence of iterations it is still a computational best response to follow them. Therefore, the protocols can be run any number of iterations, and are immune to backward induction. The Mean of Communication assumed is a broadcast channel, and we consider both the simultaneous and non-simultaneous cases.

  • TCC - Cryptography and game theory: designing protocols for exchanging information
    Theory of Cryptography, 1
    Co-Authors: Gillat Kol, Moni Naor
    Abstract:

    The goal of this paper is finding fair protocols for the secret sharing and secure multiparty computation (SMPC) problems, when players are assumed to be rational. It was observed by Halpern and Teague (STOC 2004) that protocols with bounded number of iterations are susceptible to backward induction and cannot be considered rational. Previously suggested cryptographic solutions all share the property of having an essential exponential upper bound on their running time, and hence they are also susceptible to backward induction. Although it seems that this bound is an inherent property of every cryptography based solution, we show that this is not the case. We suggest coalition-resilient secret sharing and SMPC protocols with the property that after any sequence of iterations it is still a computational best response to follow them. Therefore, the protocols can be run any number of iterations, and are immune to backward induction. The Mean of Communication assumed is a broadcast channel, and we consider both the simultaneous and non-simultaneous cases.