Sciweavers

5324 search results - page 656 / 1065
» Internet Security Protocols
Sort
View
EUROCRYPT
2000
Springer
15 years 9 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Public-Key Locally-Decodable Codes
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
Brett Hemenway, Rafail Ostrovsky
DBSEC
2007
104views Database» more  DBSEC 2007»
15 years 7 months ago
New Paradigm of Inference Control with Trusted Computing
Abstract. The database server is a crucial bottleneck in traditional inference control architecture, as it enforces highly computation-intensive auditing for all users who query th...
Yanjiang Yang, Yingjiu Li, Robert H. Deng
ENTCS
2007
104views more  ENTCS 2007»
15 years 6 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
JSAC
2006
155views more  JSAC 2006»
15 years 6 months ago
LR-AKE-Based AAA for Network Mobility (NEMO) Over Wireless Links
Network mobility introduces far more complexity than host mobility. Therefore, host mobility protocols such as Mobile IPv6 (MIPv6) need to be extended to support this new type of m...
Hanane Fathi, SeongHan Shin, Kazukuni Kobara, Shya...