Sciweavers

123 search results - page 17 / 25
» Secure implementations of typed channel abstractions
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Acute: high-level programming language design for distributed computation
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...
Peter Sewell, James J. Leifer, Keith Wansbrough, F...
CRYPTO
2005
Springer
104views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On the Discrete Logarithm Problem on Algebraic Tori
Abstract. Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm pr...
Robert Granger, Frederik Vercauteren
TCC
2007
Springer
110views Cryptology» more  TCC 2007»
14 years 1 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...
INFOCOM
2002
IEEE
14 years 18 days ago
Constraint-based path selection methods for on-demand provisioning in WDM networks
Abstract-- We propose a framework for decentralized path selection and on-demand wavelength channel provisioning in WDM networks with routing constraints. Within this framework, th...
Admela Jukan, Gerald Franzl
CRYPTO
2006
Springer
106views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
On Robust Combiners for Private Information Retrieval and Other Primitives
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
Remo Meier, Bartosz Przydatek