Bar-Ilan University

Displaying 1-40 of 53 results

  • White Papers // Jan 2014

    Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions

    Blind signature schemes, introduced by the researcher, are a fascinating primitive that (roughly speaking) enable a user to interact with a signer and obtain a signature on a message m without revealing anything about m to the signer. The authors show a new protocol for blind signatures in which security...

    Provided By Bar-Ilan University

  • White Papers // Dec 2013

    Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries

    In the setting of secure two-party computation, two parties wish to securely compute a joint function of their private inputs, while revealing only the output. One of the primary techniques for achieving efficient secure two-party computation is that of Yao's garbled circuits (FOCS 1986). In the semi-honest model, where just...

    Provided By Bar-Ilan University

  • White Papers // Dec 2013

    Fair and Efficient Secure Multiparty Computation with Reputation Systems

    A reputation system for a set of entities is essentially a list of scores that provides a measure of the reliability of each entity in the set. The score given to an entity can be interpreted (and in the reputation system literature it often is) as the probability that an...

    Provided By Bar-Ilan University

  • White Papers // Nov 2012

    SCAPI: The Secure Computation Application Programming Interface

    Secure two-party and multiparty computation has long stood at the center of the foundations of theoretical cryptography. Recently, however, interest has grown regarding the efficiency of such protocols and their application in practice. As a result, there has been significant progress on this problem and it is possible to actually...

    Provided By Bar-Ilan University

  • White Papers // Oct 2012

    Polynomial Time Cryptanalysis of Noncommutative-Algebraic Key Exchange Protocols

    Key Exchange Protocols (KEPs) make it possible for two electronic entities, Alice and Bob, to establish a shared secret key over a public communication channel. Since Diffie and Hellman's 1976 breakthrough KEP, few alternative KEP proposals resisted cryptanalysis. The authors introduce the linear centralizer method for a passive adversary to...

    Provided By Bar-Ilan University

  • White Papers // Oct 2012

    Leakage-Resilient Cryptography from Minimal Assumptions

    A central goal in cryptography is to base cryptosystems on intractability assumptions that are as weak and as general as possible; that way, if one problem turns out to be susceptible to a new attack or if another turns out to yield better performance, the authors may readily replace the...

    Provided By Bar-Ilan University

  • White Papers // Jun 2012

    On the Feasibility of Extending Oblivious Transfer

    Oblivious transfer is one of the most basic and important building blocks in cryptography. As such, understanding its cost is of prime importance. Beaver (STOC 1996) showed that it is possible to obtain poly(n) oblivious transfers given only n actual oblivious transfer calls and using one-way functions, where n is...

    Provided By Bar-Ilan University

  • White Papers // May 2012

    Security of Patched DNS

    In spite of the availability of DNSSEC, which protects against cache poisoning even by MitM attackers, many caching DNS resolvers still rely for their security against poisoning on merely validating that DNS responses contain some 'Unpredictable' values, copied from the re-quest. These values include the 16 bit identifier field, and...

    Provided By Bar-Ilan University

  • White Papers // Nov 2011

    Multiparty Computation With Low Communication, Computation and Interaction Via Threshold FHE

    Fully Homomorphic Encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: Alice encrypts her input under her key, Bob homomorphically evaluates the desired function on Alice's ciphertext and his own input, and sends the encrypted output to Alice. Extending this approach to multiple...

    Provided By Bar-Ilan University

  • White Papers // Jul 2011

    Bounds on the Capacity of OFDM Underspread Frequency Selective Fading Channels

    The analysis of the channel capacity in the absence of prior channel knowledge (noncoherent channel) has gained increasing interest in recent years, but it is still unknown for the general case. In this paper, the authors derive bounds on the capacity of the noncoherent, underspread complex Gaussian, orthogonal frequency division...

    Provided By Bar-Ilan University

  • White Papers // Apr 2011

    Proofs of Ownership in Remote Storage Systems

    Cloud storage systems are increasingly popular nowadays, and a promising technology to keep their cost down is deduplication, namely removing unnecessary copies of repeating data. Moreover, client-side deduplication attempts to identify deduplication opportunities already at the client and save the bandwidth in uploading another copy of an existing file to...

    Provided By Bar-Ilan University

  • White Papers // Apr 2011

    Comparing Agents' Success Against People in Security Domains

    The interaction of people with autonomous agents has become increasingly prevalent. Some of these settings include security domains, where people can be characterized as uncooperative, hostile, manipulative, and tending to take advantage of the situation for their own needs. This paper makes it challenging to design proficient agents to interact...

    Provided By Bar-Ilan University

  • White Papers // Apr 2011

    A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

    In the setting of secure multiparty computation, a set of n parties with private inputs wish to jointly compute some functionality of their inputs. One of the most fundamental results of information-theoretically secure computation was presented by Ben-Or, Goldwasser and Wigderson (BGW) in 1988. They demonstrated that any n-party functionality...

    Provided By Bar-Ilan University

  • White Papers // Mar 2011

    A Practical Application of Differential Privacy to Personalized Online Advertising

    Online advertising plays an important role in supporting many Internet services. Personalized online advertising offers marketers a way to direct ads at very specific audiences. The vast body of Internet users combined with the ease of creating and monitoring personalized advertising campaigns make online advertising an extremely strong tool for...

    Provided By Bar-Ilan University

  • White Papers // Jan 2011

    Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

    Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. Recently, a number of protocols have been proposed for the efficient construction of two-party computation secure in the presence of malicious...

    Provided By Bar-Ilan University

  • White Papers // Dec 2010

    Manipulating Multistage Interconnection Networks Using Fundamental Arrangements

    Optimizing interconnection networks is a prime object in switching schemes. In this paper the authors present a novel approach for obtaining a required channel arrangement in a multi-stage interconnection network, using a new concept - a fundamental arrangement. The fundamental arrangement is an initial N-1 stage switch arrangement that allows...

    Provided By Bar-Ilan University

  • White Papers // Oct 2010

    A Note on the Relation Between the Definitions of Security for Semi-Honest and Malicious Adversaries

    In secure computation, a set of parties wish to jointly compute some function of their private inputs while preserving security properties like privacy, correctness and more. The two main adversary models that have been considered are semi-honest adversaries who follow the prescribed protocol but try to glean more information than...

    Provided By Bar-Ilan University

  • White Papers // Aug 2010

    Secure Guaranteed Computation

    The authors introduce secure guaranteed two-party computation, where parties commit in advance to compute a function over their private inputs, by providing some (validated) compensation, such that if a party fails to provide an appropriate input during protocol execution, then the peer receives the compensation. Enforcement of the guarantees requires...

    Provided By Bar-Ilan University

  • White Papers // Jul 2010

    A Study of the Usability of Multicore Threading Tools

    The primary consequence of the transition to multicore processors is that applications will increasingly need to be parallelized to fully exploit the throughput gains now becoming available. Unfortunately, parallel programming is no doubt much more tedious and error-prone than serial programming. Software vendors have begun efforts to educate developers and...

    Provided By Bar-Ilan University

  • White Papers // Jul 2010

    The Economics Of Collective Brands

    The authors consider the consequences of a shared brand name such as geographical names used to identify high quality products, for the incentives of otherwise autonomous firms to invest in quality. The authors contend that such collective brand labels improve communication between sellers and consumers, when the scale of production...

    Provided By Bar-Ilan University

  • White Papers // Jun 2010

    Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

    In the setting of secure two-party and multiparty computation, parties with private inputs wish to securely compute some joint function of their inputs, where \"Security\" must hold in the presence of adversarial behavior by some of the parties. In the setting of secure computation, a set of parties wish to...

    Provided By Bar-Ilan University

  • White Papers // Jun 2010

    The Evolution Of Secularization: Cultural Transmission, Religion And Fertility Theory, Simulations And Evidence

    This paper presents an evolutionary process of secularization that integrates a theoretical model, simulations, and an empirical estimation that employs data from 32 countries (included in the International Social Survey Program: Religion II - ISSP, 1998). Following Bisin and Verdier (2000, 2001a), it is assumed that cultural/social norms are transmitted...

    Provided By Bar-Ilan University

  • White Papers // Jun 2010

    Is Specialization Desirable In Committee Decision Making?

    Committee decision making is examined in this paper focusing on the role assigned to the committee members. In particular, the authors are concerned about the comparison between committee performance under specialization and non-specialization of the decision makers. Collective decisions are best made by having many people involved in the process...

    Provided By Bar-Ilan University

  • White Papers // Apr 2010

    Denial of Service Protection with Beaver

    The authors present Beaver, a method and architecture to \"Build dams\" to protect servers from Denial of Service (DoS) attacks. Beaver allows efficient filtering of DoS traffic using low-cost, high-performance, readily-available packet filtering mechanisms. Beaver improves on previous solutions by not requiring cryptographic processing of messages, allowing the use of...

    Provided By Bar-Ilan University

  • White Papers // Apr 2010

    Is Skilled Immigration Always Good For Growth In The Receiving Economy?

    Highly skilled immigration can be growth enhancing if the positive contribution of the imported brains to the host economy's human capital stock outweighs the immigration-induced adverse effect on educational incentives for natives, or growth depleting if the latter effect dominates. This work examines the effect of a sizable highly skilled...

    Provided By Bar-Ilan University

  • White Papers // Apr 2010

    Immigration, Fertility And Human Capital: A Model Of Economic Decline Of The West

    The author shows how the influences of unskilled immigration, differential fertility between immigrants and the local indigenous population, and incentives for investment in human capital combine to predict the decline of the West. In particular, indigenous low-skilled workers lose from unskilled immigration even if the indigenous low-skilled workers do not...

    Provided By Bar-Ilan University

  • White Papers // Feb 2010

    DNS-Based Email Sender Authentication Mechanisms: A Critical Review

    The Internet facilitates efficient, low-cost communication worldwide, allowing universal connectivity for many purposes, and providing great value to society and users. The authors describe and compare three predominant email sender authentication mechanisms based on DNS: SPF, DKIM and Sender-ID Framework (SIDF). These mechanisms are designed mainly to assist in filtering...

    Provided By Bar-Ilan University

  • White Papers // Feb 2010

    Learning With Personal Laptops in School: Benefits & Gains, Obstacles & Constraints - Following a Longitudinal Study

    Despite the many ways in which computers can be distributed in schools, teachers' and students' reports still indicate that computers are used only part of time, and a small part at that. Around the world there is a dramatic increase in initiatives that provide laptops to students and teachers. Early...

    Provided By Bar-Ilan University

  • White Papers // Feb 2010

    Coordination And Critical Mass In A Network Market: An Experimental Investigation

    A network market is a market in which the benefit each consumer derives from a good is an increasing function of the number of consumers who own the same or similar goods. A major obstacle that plagues the introduction of a network good is the ability to reach critical mass,...

    Provided By Bar-Ilan University

  • White Papers // Dec 2009

    Information-Theoretically Secure Protocols and Security Under Composition

    This paper investigates the question of whether security of protocols in the information-theoretic setting (Where the adversary is computationally unbounded) implies the security of these protocols under concurrent composition. This question is motivated by the folklore that all known protocols that are secure in the information-theoretic setting are indeed secure...

    Provided By Bar-Ilan University

  • White Papers // Oct 2009

    Aggregate Message Authentication Codes

    This paper proposes and investigates the notions relating to Aggregate Authentication Codes (MACs). These have the property of aggregating multiple MAC tags to form a shorter tag that maintains its ability to be verified by a recipient sharing a unique key with each of the senders. The paper suggests aggregate...

    Provided By Bar-Ilan University

  • White Papers // Jul 2009

    The Big Carrot: High-Stakes Incentives Revisited

    This paper provides an empirical example of high-stakes incentives in relation to religious practice. First, the author shows that incentives (based on absolute belief) play a salient role in religious performance. Second, the author finds that, when both positive (heaven) and negative (hell) incentives are available, the former are more...

    Provided By Bar-Ilan University

  • White Papers // Jun 2009

    Framing-Based Choice: A Model Of Decision-Making Under Risk

    In this paper the authors propose an axiomatic theory of decision-making under risk that is based on a new approach to the modeling of framing that focuses on the subjective statistical dependence between prizes of compared lotteries. Unlike existing models that allow objective statistical dependence, as in Regret Theory, in...

    Provided By Bar-Ilan University

  • White Papers // Jun 2009

    Legally Enforceable Fairness in Secure Two-Party Computation

    In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should be carried out in a secure way, meaning that the properties privacy, correctness, independence of inputs, fairness and guaranteed output delivery should all...

    Provided By Bar-Ilan University

  • White Papers // Jun 2009

    Utility Dependence in Correct and Fair Rational Secret Sharing

    The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that has been studied considerably is that of rational secret sharing. In this setting, the aim is to construct a mechanism (protocol) so that parties behaving...

    Provided By Bar-Ilan University

  • White Papers // May 2009

    The Efficient And Fair Approval Of "Multiple-Cost - Singlebenefit" Projects Under Unilateral Information

    This paper mainly focuses on indivisible multiple-cost - single-benefit projects that must be approved by the government. A simple mechanism is proposed that ensures an efficient and fair implementation of such projects. The proposed mechanism is appropriate for a unilateral information structure: the single beneficiary has complete information on the...

    Provided By Bar-Ilan University

  • White Papers // Apr 2009

    The Rise And Fall Of America's First Bank

    In 1686 the leadership of Massachusetts was involved in the first operational bank scheme in America. In 1688 this note-issuing bank was mysteriously aborted at an advanced stage. It was a unique opportunity for financial development that did not arise again for decades. The author suggests a new, simple explanation...

    Provided By Bar-Ilan University

  • White Papers // Apr 2009

    Legal Tender

    The legal foundation of the monetary system is the law of legal tender. The "Legal tender" concept is used in models to describe almost anything except for what it really means in actual laws. Such errors prevent an accurate evaluation of the importance of this legal status. This note explains...

    Provided By Bar-Ilan University

  • White Papers // Mar 2009

    Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

    In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should be carried out in a secure way, meaning that no coalition of corrupted parties should be able to learn more than specified or...

    Provided By Bar-Ilan University

  • White Papers // Feb 2009

    A General Index Of Inherent Risk

    The authors extend the pioneering work of Aumann and Serrano by presenting an index of inherent riskiness of a gamble having the desirable properties of their index, while being applicable to gambles with either positive or negative expectations. As such, the index provides a measure of riskiness which is of...

    Provided By Bar-Ilan University

  • White Papers // May 2012

    Security of Patched DNS

    In spite of the availability of DNSSEC, which protects against cache poisoning even by MitM attackers, many caching DNS resolvers still rely for their security against poisoning on merely validating that DNS responses contain some 'Unpredictable' values, copied from the re-quest. These values include the 16 bit identifier field, and...

    Provided By Bar-Ilan University

  • White Papers // Apr 2011

    A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

    In the setting of secure multiparty computation, a set of n parties with private inputs wish to jointly compute some functionality of their inputs. One of the most fundamental results of information-theoretically secure computation was presented by Ben-Or, Goldwasser and Wigderson (BGW) in 1988. They demonstrated that any n-party functionality...

    Provided By Bar-Ilan University

  • White Papers // Aug 2010

    Secure Guaranteed Computation

    The authors introduce secure guaranteed two-party computation, where parties commit in advance to compute a function over their private inputs, by providing some (validated) compensation, such that if a party fails to provide an appropriate input during protocol execution, then the peer receives the compensation. Enforcement of the guarantees requires...

    Provided By Bar-Ilan University

  • White Papers // Sep 2008

    Efficient Protocols for Set Intersection and Pattern Matching With Security Against Malicious and Covert Adversaries

    In this paper the authors construct efficient secure protocols for set intersection and pattern matching. The protocols for securely computing the set intersection functionality are based on secure pseudorandom function evaluations, in contrast to previous protocols that are based on polynomials. In addition to the above, they also use secure...

    Provided By Bar-Ilan University

  • White Papers // Mar 2009

    Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

    In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should be carried out in a secure way, meaning that no coalition of corrupted parties should be able to learn more than specified or...

    Provided By Bar-Ilan University

  • White Papers // Dec 2010

    Manipulating Multistage Interconnection Networks Using Fundamental Arrangements

    Optimizing interconnection networks is a prime object in switching schemes. In this paper the authors present a novel approach for obtaining a required channel arrangement in a multi-stage interconnection network, using a new concept - a fundamental arrangement. The fundamental arrangement is an initial N-1 stage switch arrangement that allows...

    Provided By Bar-Ilan University

  • White Papers // Jun 2008

    The Layered Games Framework for Specifications and Analysis of Security Protocols

    The authors establish rigorous foundations to the use of modular, layered design for building complex distributed systems, resilient to failures and attacks. Layering is key to the design of the Internet and other distributed systems. Hence, solid, theoretical foundations are essential, especially when considering adversarial settings, such as for security...

    Provided By Bar-Ilan University

  • White Papers // Jul 2011

    Bounds on the Capacity of OFDM Underspread Frequency Selective Fading Channels

    The analysis of the channel capacity in the absence of prior channel knowledge (noncoherent channel) has gained increasing interest in recent years, but it is still unknown for the general case. In this paper, the authors derive bounds on the capacity of the noncoherent, underspread complex Gaussian, orthogonal frequency division...

    Provided By Bar-Ilan University

  • White Papers // Apr 2011

    Proofs of Ownership in Remote Storage Systems

    Cloud storage systems are increasingly popular nowadays, and a promising technology to keep their cost down is deduplication, namely removing unnecessary copies of repeating data. Moreover, client-side deduplication attempts to identify deduplication opportunities already at the client and save the bandwidth in uploading another copy of an existing file to...

    Provided By Bar-Ilan University

  • White Papers // Dec 2008

    SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks

    The rules governing the availability and quality of connections in a wireless network are described by physical models such as the Signal-to-Interference & Noise Ratio (SINR) model. For a collection of simultaneously transmitting stations in the plane, it is possible to identify a reception zone for each station, consisting of...

    Provided By Bar-Ilan University

  • White Papers // Nov 2011

    Multiparty Computation With Low Communication, Computation and Interaction Via Threshold FHE

    Fully Homomorphic Encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: Alice encrypts her input under her key, Bob homomorphically evaluates the desired function on Alice's ciphertext and his own input, and sends the encrypted output to Alice. Extending this approach to multiple...

    Provided By Bar-Ilan University

  • White Papers // Oct 2012

    Leakage-Resilient Cryptography from Minimal Assumptions

    A central goal in cryptography is to base cryptosystems on intractability assumptions that are as weak and as general as possible; that way, if one problem turns out to be susceptible to a new attack or if another turns out to yield better performance, the authors may readily replace the...

    Provided By Bar-Ilan University

  • White Papers // Jun 2012

    On the Feasibility of Extending Oblivious Transfer

    Oblivious transfer is one of the most basic and important building blocks in cryptography. As such, understanding its cost is of prime importance. Beaver (STOC 1996) showed that it is possible to obtain poly(n) oblivious transfers given only n actual oblivious transfer calls and using one-way functions, where n is...

    Provided By Bar-Ilan University

  • White Papers // Apr 2010

    Denial of Service Protection with Beaver

    The authors present Beaver, a method and architecture to \"Build dams\" to protect servers from Denial of Service (DoS) attacks. Beaver allows efficient filtering of DoS traffic using low-cost, high-performance, readily-available packet filtering mechanisms. Beaver improves on previous solutions by not requiring cryptographic processing of messages, allowing the use of...

    Provided By Bar-Ilan University

  • White Papers // Dec 2013

    Fair and Efficient Secure Multiparty Computation with Reputation Systems

    A reputation system for a set of entities is essentially a list of scores that provides a measure of the reliability of each entity in the set. The score given to an entity can be interpreted (and in the reputation system literature it often is) as the probability that an...

    Provided By Bar-Ilan University

  • White Papers // Dec 2013

    Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries

    In the setting of secure two-party computation, two parties wish to securely compute a joint function of their private inputs, while revealing only the output. One of the primary techniques for achieving efficient secure two-party computation is that of Yao's garbled circuits (FOCS 1986). In the semi-honest model, where just...

    Provided By Bar-Ilan University

  • White Papers // Jan 2011

    Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

    Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. Recently, a number of protocols have been proposed for the efficient construction of two-party computation secure in the presence of malicious...

    Provided By Bar-Ilan University

  • White Papers // Jun 2009

    Utility Dependence in Correct and Fair Rational Secret Sharing

    The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that has been studied considerably is that of rational secret sharing. In this setting, the aim is to construct a mechanism (protocol) so that parties behaving...

    Provided By Bar-Ilan University

  • White Papers // Jan 2014

    Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions

    Blind signature schemes, introduced by the researcher, are a fascinating primitive that (roughly speaking) enable a user to interact with a signer and obtain a signature on a message m without revealing anything about m to the signer. The authors show a new protocol for blind signatures in which security...

    Provided By Bar-Ilan University

  • White Papers // Jul 2007

    An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

    The authors show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secure in the presence of semi-honest adversaries, and can be transformed into a protocol that achieves security against malicious adversaries by applying the compiler of Goldreich, Micali...

    Provided By Bar-Ilan University

  • White Papers // Apr 2011

    Comparing Agents' Success Against People in Security Domains

    The interaction of people with autonomous agents has become increasingly prevalent. Some of these settings include security domains, where people can be characterized as uncooperative, hostile, manipulative, and tending to take advantage of the situation for their own needs. This paper makes it challenging to design proficient agents to interact...

    Provided By Bar-Ilan University

  • White Papers // Jun 2010

    Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

    In the setting of secure two-party and multiparty computation, parties with private inputs wish to securely compute some joint function of their inputs, where \"Security\" must hold in the presence of adversarial behavior by some of the parties. In the setting of secure computation, a set of parties wish to...

    Provided By Bar-Ilan University

  • White Papers // Feb 2010

    DNS-Based Email Sender Authentication Mechanisms: A Critical Review

    The Internet facilitates efficient, low-cost communication worldwide, allowing universal connectivity for many purposes, and providing great value to society and users. The authors describe and compare three predominant email sender authentication mechanisms based on DNS: SPF, DKIM and Sender-ID Framework (SIDF). These mechanisms are designed mainly to assist in filtering...

    Provided By Bar-Ilan University

  • White Papers // Sep 2006

    Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model

    Until recently, most research on the topic of secure computation focused on the stand-alone model, where a single protocol execution takes place. In this paper, the authors construct protocols for the setting of bounded-concurrent self-composition, where a (single) secure protocol is run many times concurrently, and there is a predetermined...

    Provided By Bar-Ilan University

  • White Papers // Jul 2008

    An Empirical Study of Denial of Service Mitigation Techniques

    This paper presents an empirical study of the resistance of several protocols to Denial of Service (DoS) attacks on client-server communication. They show that protocols that use authentication alone, e.g., IPSec, provide protection to some extent, but are still susceptible to DoS attacks, even when the network is not congested....

    Provided By Bar-Ilan University

  • White Papers // Jan 2009

    Making Privacy-Preserving Data Mining Practical With Smartcards

    Data mining provides large benefits to the commercial, government and homeland security sectors, but the aggregation and storage of huge amounts of data about citizens inevitably leads to an erosion of privacy. To achieve the benefits that data mining has to offer, while at the same time enhancing privacy, one...

    Provided By Bar-Ilan University

  • White Papers // Feb 2010

    Learning With Personal Laptops in School: Benefits & Gains, Obstacles & Constraints - Following a Longitudinal Study

    Despite the many ways in which computers can be distributed in schools, teachers' and students' reports still indicate that computers are used only part of time, and a small part at that. Around the world there is a dramatic increase in initiatives that provide laptops to students and teachers. Early...

    Provided By Bar-Ilan University

  • White Papers // Oct 2009

    Aggregate Message Authentication Codes

    This paper proposes and investigates the notions relating to Aggregate Authentication Codes (MACs). These have the property of aggregating multiple MAC tags to form a shorter tag that maintains its ability to be verified by a recipient sharing a unique key with each of the senders. The paper suggests aggregate...

    Provided By Bar-Ilan University

  • White Papers // Jul 2010

    A Study of the Usability of Multicore Threading Tools

    The primary consequence of the transition to multicore processors is that applications will increasingly need to be parallelized to fully exploit the throughput gains now becoming available. Unfortunately, parallel programming is no doubt much more tedious and error-prone than serial programming. Software vendors have begun efforts to educate developers and...

    Provided By Bar-Ilan University

  • White Papers // May 2008

    Secure Multiparty Computation for Privacy-Preserving Data Mining

    In this paper, the authors' survey the basic paradigms and notions of secure multiparty computation and discuss their relevance to the field of privacy-preserving data mining. In addition to re-viewing definitions and constructions for secure multiparty computation, they discuss the issue of efficiency and demonstrate the difficulties involved in constructing...

    Provided By Bar-Ilan University

  • White Papers // Jul 2010

    The Economics Of Collective Brands

    The authors consider the consequences of a shared brand name such as geographical names used to identify high quality products, for the incentives of otherwise autonomous firms to invest in quality. The authors contend that such collective brand labels improve communication between sellers and consumers, when the scale of production...

    Provided By Bar-Ilan University

  • White Papers // Jun 2009

    Framing-Based Choice: A Model Of Decision-Making Under Risk

    In this paper the authors propose an axiomatic theory of decision-making under risk that is based on a new approach to the modeling of framing that focuses on the subjective statistical dependence between prizes of compared lotteries. Unlike existing models that allow objective statistical dependence, as in Regret Theory, in...

    Provided By Bar-Ilan University

  • White Papers // May 2009

    The Efficient And Fair Approval Of "Multiple-Cost - Singlebenefit" Projects Under Unilateral Information

    This paper mainly focuses on indivisible multiple-cost - single-benefit projects that must be approved by the government. A simple mechanism is proposed that ensures an efficient and fair implementation of such projects. The proposed mechanism is appropriate for a unilateral information structure: the single beneficiary has complete information on the...

    Provided By Bar-Ilan University

  • White Papers // Dec 2008

    The Impact Of Insider Trading On Forecasting In A Bookmakers' Horse Betting Market

    Successful forecasting of horse race outcomes requires that the forecaster has a clear understanding of the variables at his disposal. The most common, and arguably important, variables in a horse betting market are the odds of the horses in a race. In the case where bookmakers operate in such a...

    Provided By Bar-Ilan University

  • White Papers // Aug 2008

    Measuring The Extent Of Inside Trading In Horse Betting Markets

    This paper develops a theoretical model that examines the optimal price setting by bookmakers in the racetrack betting market and then uses it to measure the extent of insider trading in the market. Bookmakers are faced with the risk that insiders will account for information arriving after the opening odds...

    Provided By Bar-Ilan University

  • White Papers // Jan 2009

    Group Specific Public Goods, Orchestration Of Interest Groups And Free Riding

    The authors consider a two group contest over a group specific public good where each member of a group has a different benefit from the good. This model can be interpreted in two ways: Each of the players has a non-linear investment cost in the contest, or alternatively, the returns...

    Provided By Bar-Ilan University

  • White Papers // Dec 2009

    Information-Theoretically Secure Protocols and Security Under Composition

    This paper investigates the question of whether security of protocols in the information-theoretic setting (Where the adversary is computationally unbounded) implies the security of these protocols under concurrent composition. This question is motivated by the folklore that all known protocols that are secure in the information-theoretic setting are indeed secure...

    Provided By Bar-Ilan University

  • White Papers // Jan 2009

    Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1

    In this paper the authors study key exchange protocols in a model where the key exchange takes place between devices with limited displays that can be compared by a human user. If the devices display the same value then the human user is convinced that the key exchange terminated successfully...

    Provided By Bar-Ilan University

  • White Papers // Oct 2010

    A Note on the Relation Between the Definitions of Security for Semi-Honest and Malicious Adversaries

    In secure computation, a set of parties wish to jointly compute some function of their private inputs while preserving security properties like privacy, correctness and more. The two main adversary models that have been considered are semi-honest adversaries who follow the prescribed protocol but try to glean more information than...

    Provided By Bar-Ilan University

  • White Papers // Jun 2009

    Legally Enforceable Fairness in Secure Two-Party Computation

    In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should be carried out in a secure way, meaning that the properties privacy, correctness, independence of inputs, fairness and guaranteed output delivery should all...

    Provided By Bar-Ilan University