Sciweavers

894 search results - page 100 / 179
» Secure Implementation of Channel Abstractions
Sort
View
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 10 months ago
MapReduce for Integer Factorization
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
Javier Tordable
IPPS
2008
IEEE
14 years 4 months ago
A Hybrid MPI design using SCTP and iWARP
Abstract— Remote Direct Memory Access (RDMA) and pointto-point network fabrics both have their own advantages. MPI middleware implementations typically use one or the other, howe...
Mike Tsai, Brad Penoff, Alan Wagner
TCC
2007
Springer
110views Cryptology» more  TCC 2007»
14 years 4 months ago
Robuster Combiners for Oblivious Transfer
Abstract. A (k; n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F, which is secure assuming that at least k...
Remo Meier, Bartosz Przydatek, Jürg Wullschle...
ESORICS
2010
Springer
13 years 11 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi
TIT
2008
187views more  TIT 2008»
13 years 9 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer