Sciweavers

133 search results - page 10 / 27
» On the Security of MOR Public Key Cryptosystem
Sort
View
CARDIS
1998
Springer
103views Hardware» more  CARDIS 1998»
13 years 11 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
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 7 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
CCS
2003
ACM
14 years 21 days ago
Receiver anonymity via incomparable public keys
We describe a new method for protecting the anonymity of message receivers in an untrusted network. Surprisingly, existing methods fail to provide the required level of anonymity ...
Brent R. Waters, Edward W. Felten, Amit Sahai
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
14 years 21 days ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai
IACR
2011
133views more  IACR 2011»
12 years 7 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti