Sciweavers

598 search results - page 3 / 120
» On the Security of ElGamal Based Encryption
Sort
View
CSREASAM
2006
13 years 9 months ago
Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...
Levent Ertaul, Vaidehi Kedlaya
FOSSACS
2004
Springer
14 years 1 months ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...
ICN
2005
Springer
14 years 1 months ago
Scalable Group Key Management with Partially Trusted Controllers
Abstract. Scalable group key management solutions are crucial for supporting Internet applications that are based on a group communication model. Many solutions have been proposed ...
Himanshu Khurana, Rafael Bonilla, Adam J. Slagell,...
CARDIS
1998
Springer
103views Hardware» more  CARDIS 1998»
13 years 12 months ago
Secure Personalization Using Proxy Cryptography
In this paper we describe new secure personalization schemes using proxy cryptography. We first introduce the context of a large scale smart card application such as an electronic ...
Pierre Girard
ASIACRYPT
2004
Springer
14 years 1 months ago
Practical Two-Party Computation Based on the Conditional Gate
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...
Berry Schoenmakers, Pim Tuyls