Sciweavers

32 search results - page 6 / 7
» tcc 2007
Sort
View
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 3 months ago
Universally Composable Security with Global Setup
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi W...
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 3 months 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
110views Cryptology» more  TCC 2007»
14 years 3 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...
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
14 years 3 months ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
IH
2007
Springer
14 years 4 months ago
Security of Invertible Media Authentication Schemes Revisited
Abstract. Dittmann, Katzenbeisser, Schallhart and Veith (IACR ePrint 2004) introduced the notion of invertible media authentication schemes, embedding authentication data in media ...
Daniel Dönigus, Stefan Endler, Marc Fischlin,...