Sciweavers

310 search results - page 25 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
LCN
2005
IEEE
15 years 3 months ago
Constructing Efficient Multi-hop Mesh Networks
The Wireless Channel-oriented Ad-hoc Multi-hop Broadband (W-CHAMB) is a new link layer protocol with the aim of being able to support Quality of Service (QoS) in multi-hop operati...
Rui Zhao, Bernhard Walke, Michael Einhaus
EUC
2008
Springer
14 years 11 months ago
Efficient Client-to-Client Password Authenticated Key Exchange
With the rapid proliferation of client-to-client applications, PAKE (password authenticated key exchange) protocols in the client-to-client setting become increasingly important. ...
Yanjiang Yang, Feng Bao, Robert H. Deng
IACR
2011
120views more  IACR 2011»
13 years 9 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
David Jao, Luca De Feo
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 1 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
SIGCOMM
1996
ACM
15 years 1 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng