Results 1  10
of
435
c © Swiss Mathematical Society, 2012 Elemente der Mathematik
"... 2005 under the supervision of Ueli Maurer. After a research period at the Centre for Quantum Computation, University of Cambridge UK, he returned to ETH in 2007 as Assistant Professor at the Institute for Theoretical Physics. His research interests are centered around quantum information theory and ..."
Abstract
 Add to MetaCart
2005 under the supervision of Ueli Maurer. After a research period at the Centre for Quantum Computation, University of Cambridge UK, he returned to ETH in 2007 as Assistant Professor at the Institute for Theoretical Physics. His research interests are centered around quantum information theory
Secret Key Agreement by Public Discussion From Common Information
 IEEE Transactions on Information Theory
, 1993
"... . The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution PX ..."
Abstract

Cited by 440 (18 self)
 Add to MetaCart
. The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution PXY Z , can also receive all messages exchanged by the two parties over a public channel. The goal of a protocol is that the enemy obtains at most a negligible amount of information about S. Upper bounds on H(S) as a function of PXY Z are presented. Lower bounds on the rate H(S)=N (as N !1) are derived for the case where X = [X 1 ; : : : ; XN ], Y = [Y 1 ; : : : ; YN ] and Z = [Z 1 ; : : : ; ZN ] result from N independent executions of a random experiment generating X i ; Y i and Z i , for i = 1; : : : ; N . In particular it is shown that such secret key agreement is possible for a scenario where all three parties receive the output of a binary symmetric source over independent binary symmetr...
From Probability Distributions to Common Secrets
, 2004
"... This thesis investigates generating a common secret between two entities by extracting a stream of random numbers obtained from measurements of the same process. The creation of the secret is based on the algorithm of Ueli Maurer described in [1], and is independent of the fact that the communicatio ..."
Abstract
 Add to MetaCart
This thesis investigates generating a common secret between two entities by extracting a stream of random numbers obtained from measurements of the same process. The creation of the secret is based on the algorithm of Ueli Maurer described in [1], and is independent of the fact
Experimental Quantum Cryptography
 Journal of Cryptology
, 1992
"... We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; 2) by subsequent public discussion of the ..."
Abstract

Cited by 268 (20 self)
 Add to MetaCart
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; 2) by subsequent public discussion of the sent and received versions of this transmission estimate the extent of eavesdropping that might have taken place on it, and finally 3) if this estimate is small enough, distill from the sent and received versions a smaller body of shared random information, which is certifiably secret in the sense that any third party's expected information on it is an exponentially small fraction of one bit. Because the system depends on the uncertainty principle of quantum physics, instead of usual mathematical assumptions such as the difficulty of factoring, it remains secure against an adversary with unlimited computing power. A preliminary version of this paper was presented at Eurocrypt '90, May 21 ...
Smoothing Probability Distributions and Smooth Entropy (Extended Abstract)
 in Proceedings of International Symposium on Information Theory, ISIT 97
, 1996
"... Christian Cachin Ueli Maurer Institute for Theoretical Computer Science ETH Zurich CH8092 Zurich, Switzerland cachin@acm.org maurer@inf.ethz.ch September 30, 1996 Abstract We introduce smooth entropy as a measure for the number of almost uniform random bits that can be extracted from a sour ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Christian Cachin Ueli Maurer Institute for Theoretical Computer Science ETH Zurich CH8092 Zurich, Switzerland cachin@acm.org maurer@inf.ethz.ch September 30, 1996 Abstract We introduce smooth entropy as a measure for the number of almost uniform random bits that can be extracted from a
Efficient Byzantine Agreement Secure Against General Adversaries (Extended Abstract)
 in Proc. 12th International Symposium on Distributed Computing (DISC
, 1998
"... ) Matthias Fitzi and Ueli Maurer Department of Computer Science Swiss Federal Institute of Technology (ETH), Zurich CH8092 Zurich, Switzerland, ffitzi,maurerg@inf.ethz.ch Abstract. This paper presents protocols for Byzantine agreement, i.e. for reliable broadcast, among a set of n players, some o ..."
Abstract
 Add to MetaCart
) Matthias Fitzi and Ueli Maurer Department of Computer Science Swiss Federal Institute of Technology (ETH), Zurich CH8092 Zurich, Switzerland, ffitzi,maurerg@inf.ethz.ch Abstract. This paper presents protocols for Byzantine agreement, i.e. for reliable broadcast, among a set of n players, some
Efficient Secure MultiParty Computation
, 2000
"... ) Martin Hirt 1 , Ueli Maurer 1 , and Bartosz Przydatek 2?? 1 ETH Zurich, Switzerland, fhirt,maurerg@inf.ethz.ch 2 Carnegie Mellon University, USA, bartosz@cs.cmu.edu Asiacrypt 2000 Abstract. Since the introduction of secure multiparty computation, all proposed protocols that provide s ..."
Abstract

Cited by 35 (7 self)
 Add to MetaCart
) Martin Hirt 1 , Ueli Maurer 1 , and Bartosz Przydatek 2?? 1 ETH Zurich, Switzerland, fhirt,maurerg@inf.ethz.ch 2 Carnegie Mellon University, USA, bartosz@cs.cmu.edu Asiacrypt 2000 Abstract. Since the introduction of secure multiparty computation, all proposed protocols that provide
General Secure MultiParty Computation from any Linear SecretSharing Scheme
, 2000
"... Abstract. We show that verifiable secret sharing (VSS) and secure multiparty computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided that the access structure of the LSSS allows MPC or VSS at all. Because an LSSS neith ..."
Abstract

Cited by 162 (23 self)
 Add to MetaCart
Abstract. We show that verifiable secret sharing (VSS) and secure multiparty computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided that the access structure of the LSSS allows MPC or VSS at all. Because an LSSS neither guarantees reconstructability when some shares are false, nor verifiability of a shared value, nor allows for the multiplication of shared values, an LSSS is an apparently much weaker primitive than VSS or MPC. Our approach to secure MPC is generic and applies to both the informationtheoretic and the cryptographic setting. The construction is based on 1) a formalization of the special multiplicative property of an LSSS that is needed to perform a multiplication on shared values, 2) an efficient generic construction to obtain from any LSSS a multiplicative LSSS for the same access structure, and 3) an efficient generic construction to build verifiability into every LSSS (always assuming that the adversary structure allows for MPC or VSS at all). The protocols are efficient. In contrast to all previous informationtheoretically secure protocols, the field size is not restricted (e.g, to be greater than n). Moreover, we exhibit adversary structures for which our protocols are polynomial in n while all previous approaches to MPC for nonthreshold adversaries provably have superpolynomial complexity. 1
Defending Against Statistical Steganalysis
 10th USENIX Security Symposium
, 2001
"... The main purpose of steganography is to hide the occurrence of communication. While most methods in use today are invisible to an observer's senses, mathematical analysis may reveal statistical anomalies in the stego medium. These discrepancies expose the fact that hidden communication is happe ..."
Abstract

Cited by 162 (1 self)
 Add to MetaCart
The main purpose of steganography is to hide the occurrence of communication. While most methods in use today are invisible to an observer's senses, mathematical analysis may reveal statistical anomalies in the stego medium. These discrepancies expose the fact that hidden communication is happening. This paper presents improved methods for information hiding. One method uses probabilistic embedding to minimize modifications to the cover medium. Another method employs errorcorrecting codes, which allow the embedding process to choose which bits to modify in a way that decreases the likelihood of being detected. In addition, we can hide multiple data sets in the same cover medium to provide plausible deniability.
Results 1  10
of
435