Sciweavers

53327 search results - page 10404 / 10666
» or 2007
Sort
View
212
Voted
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
16 years 8 days ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
TCC
2007
Springer
142views Cryptology» more  TCC 2007»
16 years 8 days ago
On Best-Possible Obfuscation
An obfuscator is a compiler that transforms any program (which we will view in this work as a boolean circuit) into an obfuscated program (also a circuit) that has the same input-...
Shafi Goldwasser, Guy N. Rothblum
TCC
2007
Springer
110views Cryptology» more  TCC 2007»
16 years 8 days 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...
TELETRAFFIC
2007
Springer
16 years 8 days ago
On the Interaction Between Internet Applications and TCP
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
Matti Siekkinen, Guillaume Urvoy-Keller, Ernst W. ...
174
Voted
TELETRAFFIC
2007
Springer
16 years 8 days ago
Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
Saikat Ray, Roch Guérin, Rute Sofia
« Prev « First page 10404 / 10666 Last » Next »