Sciweavers

189 search results - page 6 / 38
» On Unconditionally Secure Computation with Vanishing Communi...
Sort
View
AC
1998
Springer
14 years 19 days ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 8 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
WCNC
2010
IEEE
13 years 6 months ago
Characterization of the Secrecy Region of a Single Relay Cooperative System
Abstract—Security is an important aspect for the future wireless networks. Since the number of network nodes increases constantly, and, in addition, the networks are decentralize...
Ninoslav Marina, Are Hjørungnes
EUROCRYPT
2004
Springer
14 years 1 months ago
Secure Computation of the k th-Ranked Element
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...
Gagan Aggarwal, Nina Mishra, Benny Pinkas
JOC
2008
86views more  JOC 2008»
13 years 8 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell