Publications related to Gracefully Degrading Fair Exchange with Security Modules

Tight Bounds on the Redundancy of Huffman Codes

In this paper, we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman c ...

Ieee-Inst Electrical Electronics Engineers Inc2012

This Time Is the Same: Using Bank Performance in 1998 to Explain Bank Performance during the Recent Financial Crisis

Rüdiger Fahlenbrach

Are some banks prone to perform poorly during crises? If yes, why? In this paper, we show that a bank's stock return performance during the 1998 crisis predicts its stock return performance and probability of failure during the recent financial crisis. Thi ...

Wiley-Blackwell2012

Daylighting Metrics: Is there a relation between Useful Daylight Illuminance and Daylight Glare Probabilty?

Marilyne Andersen, Nicolas Roy

The establishment of climate-based daylight modeling within research and practice has led to a fundamental reassessment of both the basis and purpose of daylight metrics. Whilst there is no consensus yet on the precise nature of the metric(s) that should r ...

2012

OPTIMAL MULTIPLE TESTS

Stephan Morgenthaler, Djalel Eddine Meskaldji

When many (m) null hypotheses are tested with a single dataset, the control of the number of false rejections is often the principal consideration. Two popular controlling rates are the probability of making at least one false discovery (Bonferroni) and th ...

2012

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Serge Vaudenay, Aikaterini Mitrokotsa

At ACM~CCS 2008, Rasmussen and Capkun introduced a distance-bounding protocol RC07 (henceforth RC protocol) where the prover and verifier use simultaneous transmissions and the verifier counts the delay between sending a challenge (starting with a hidden m ...

IEEE2012

Cavity Optomechanics: Cooling of a Micromechanical Oscillator into the Quantum Regime

Tobias Kippenberg, Albert Schliesser, Emanuel Gavartin, Stefan Alexander Weis

Using optical sideband cooling, a micromechanical oscillator is cooled to a phonon occupancy below 10 phonons, corresponding to a probability of finding it in its quantum ground state more than 10% of the time. ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Expectations as Endowments: Evidence on Reference-Dependent Preferences from Exchange and Valuation Experiments

Andreas Fuster

While evidence suggests that people evaluate outcomes with respect to reference points, little is known about what determines them. We conduct two experiments that show that reference points are determined, at least in part, by expectations. In an exchange ...

2011

Cooling of a Micromechanical Oscillator into the Quantum Regime

Tobias Kippenberg, Albert Schliesser, Emanuel Gavartin, Stefan Alexander Weis

Using optical sideband cooling, a micromechanical oscillator is cooled to a phonon occupancy below 10 phonons, corresponding to a probability of finding it in its quantum ground state more than 10% of the time. ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Scalable and Secure Aggregation in Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

We consider the problem of computing an aggregation function in a \emph{secure} and \emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of

O(n^3)

, we present a distributed protocol that r ...

CoRR2011

The Distributed Multiple Voting Problem

Martin Vetterli, Patrick Thiran, Florence Bénézit

A networked set of agents holding binary opinions does not seem to be able to compute its majority opinion by means of local binary interactions only. However, the majority problem can be solved using two or more bits, instead of one [1]. Pairs of agents a ...

2011

Gracefully Degrading Fair Exchange with Security Modules

Graph Chatbot

Chat with Graph Search

Tight Bounds on the Redundancy of Huffman Codes

This Time Is the Same: Using Bank Performance in 1998 to Explain Bank Performance during the Recent Financial Crisis

Daylighting Metrics: Is there a relation between Useful Daylight Illuminance and Daylight Glare Probabilty?

OPTIMAL MULTIPLE TESTS

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Cavity Optomechanics: Cooling of a Micromechanical Oscillator into the Quantum Regime

Expectations as Endowments: Evidence on Reference-Dependent Preferences from Exchange and Valuation Experiments

Cooling of a Micromechanical Oscillator into the Quantum Regime

Scalable and Secure Aggregation in Distributed Networks

The Distributed Multiple Voting Problem

Tight Bounds on the Redundancy of Huffman Codes

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Expectations as Endowments: Evidence on Reference-Dependent Preferences from Exchange and Valuation Experiments

Cavity Optomechanics: Cooling of a Micromechanical Oscillator into the Quantum Regime

OPTIMAL MULTIPLE TESTS

Cooling of a Micromechanical Oscillator into the Quantum Regime

This Time Is the Same: Using Bank Performance in 1998 to Explain Bank Performance during the Recent Financial Crisis

Daylighting Metrics: Is there a relation between Useful Daylight Illuminance and Daylight Glare Probabilty?

Scalable and Secure Aggregation in Distributed Networks

The Distributed Multiple Voting Problem