Sciweavers

4529 search results - page 395 / 906
» Position Based Cryptography
Sort
View
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
16 years 1 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»
16 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...
IPPS
2006
IEEE
16 years 1 months ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
ACNS
2006
Springer
121views Cryptology» more  ACNS 2006»
16 years 1 months ago
Authentication for Paranoids: Multi-party Secret Handshakes
In a society increasingly concerned with the steady assault on electronic privacy, the need for privacy-preserving techniques is both natural and justified. This need extends to t...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
NSPW
2006
ACM
16 years 1 months ago
Googling considered harmful
Virtually every Internet user on the planet uses the powerful free tools offered by a handful of information service providers in many aspects of their personal and professional l...
Gregory J. Conti