Sciweavers

346 search results - page 29 / 70
» The Secret Santa Problem
Sort
View
IJNSEC
2010
73views more  IJNSEC 2010»
14 years 4 months ago
Provable Partial Key Escrow
In this paper we first propose two new concepts concerning the notion of key escrow schemes: provable partiality and independence. Roughly speaking, a scheme has provable partiali...
Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasiz...
CODASPY
2012
13 years 5 months ago
Identifying native applications with high assurance
Main stream operating system kernels lack a strong and reliable mechanism for identifying the running processes and binding them to the corresponding executable applications. In t...
Hussain M. J. Almohri, Danfeng (Daphne) Yao, Denni...
83
Voted
RIVF
2007
14 years 11 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
EUROCRYPT
2000
Springer
15 years 1 months ago
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order to communicate privately. In this paper we consider in...
Ueli M. Maurer, Stefan Wolf
81
Voted
ACL
1996
14 years 11 months ago
Combining Trigram-based and Feature-based Methods for Context-Sensitive Spelling Correction
This paper addresses the problem of correcting spelling errors that result in valid, though unintended words (such as peace and piece, or quiet and quite) and also the problem of ...
Andrew R. Golding, Yves Schabes