Sciweavers

140 search results - page 27 / 28
» Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi...
Sort
View
ASIACRYPT
2009
Springer
14 years 2 days ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
ACMICEC
2003
ACM
113views ECommerce» more  ACMICEC 2003»
13 years 10 months ago
PayCash: a secure efficient Internet payment system
This paper describes PayCash, an Internet payment system that was designed to offer strong security and privacy protection. This system is based on the concept of electronic cash,...
Jon M. Peha, Ildar M. Khamitov
CCS
2008
ACM
13 years 7 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
JOC
2010
82views more  JOC 2010»
13 years 8 days ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth
ICISC
2007
100views Cryptology» more  ICISC 2007»
13 years 7 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