Sciweavers

757 search results - page 72 / 152
» How secure are secure interdomain routing protocols
Sort
View
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 8 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 7 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
CCS
2006
ACM
13 years 11 months ago
Securing the drop-box architecture for assisted living
Home medical devices enable individuals to monitor some of their own health information without the need for visits by nurses or trips to medical facilities. This enables more con...
Michael J. May, Wook Shin, Carl A. Gunter, Insup L...
NETWORK
2008
106views more  NETWORK 2008»
13 years 7 months ago
Toward internet-wide multipath routing
The Internet would be more efficient and robust if routers could flexibly divide traffic over multiple paths. Often, having one or two extra paths is sufficient for customizing pa...
Jiayue He, Jennifer Rexford
ICISC
2007
100views Cryptology» more  ICISC 2007»
13 years 9 months ago
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi