Sciweavers

56 search results - page 6 / 12
» Secret Sharing Made Short
Sort
View
ESORICS
2008
Springer
13 years 10 months ago
Sharemind: A Framework for Fast Privacy-Preserving Computations
Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably...
Dan Bogdanov, Sven Laur, Jan Willemson
CCS
2009
ACM
14 years 9 months ago
Hidden credential retrieval from a reusable password
We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access ...
Xavier Boyen
INDOCRYPT
2009
Springer
14 years 3 months ago
Two Attacks against the Ff RFID Protocol
This paper investigates a new family of RFID protocols called Ff that grew out of a proposal made at ESORICS 2007. This family has the property of having highly efficient implement...
Olivier Billet, Kaoutar Elkhiyaoui
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
14 years 9 months ago
Secure multi-party quantum computation
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
Claude Crépeau, Daniel Gottesman, Adam Smit...
EUROCRYPT
2004
Springer
14 years 2 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer