Sciweavers

58 search results - page 5 / 12
» crypto 2008
Sort
View
CRYPTO
2009
Springer
109views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
Randomizable Proofs and Delegatable Anonymous Credentials
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
Mira Belenkiy, Jan Camenisch, Melissa Chase, Marku...
CRYPTO
2010
Springer
110views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
An Efficient and Parallel Gaussian Sampler for Lattices
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
Chris Peikert
CANS
2008
Springer
98views Cryptology» more  CANS 2008»
13 years 10 months ago
Counting Method for Multi-party Computation over Non-abelian Groups
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
Youming Qiao, Christophe Tartary
CARDIS
2008
Springer
106views Hardware» more  CARDIS 2008»
13 years 10 months ago
Secure Implementation of the Stern Authentication and Signature Schemes for Low-Resource Devices
Abstract. In this paper we describe the first implementation on smartcard of the code-based authentication protocol proposed by Stern at Crypto'93 and we give a securization o...
Pierre-Louis Cayrel, Philippe Gaborit, Emmanuel Pr...
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Bi-Deniable Public-Key Encryption
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
Adam O'Neill, Chris Peikert, Brent Waters