Sciweavers

2601 search results - page 93 / 521
» Secure Rewarding Schemes
Sort
View
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 7 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
IJACT
2008
64views more  IJACT 2008»
15 years 3 months ago
An efficient one-move Nominative Signature scheme
Abstract. A signer in a Nominative Signature (NS) scheme can arbitrarily choose a nominee, then jointly generate a signature in such a way that the signature can only be verified w...
Qiong Huang, Dennis Y. W. Liu, Duncan S. Wong
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 9 months ago
Secure Hybrid Encryption from Weakened Key Encapsulation
We put forward a new paradigm for building hybrid encryption schemes from constrained chosen-ciphertext secure (CCCA) key-encapsulation mechanisms (KEMs) plus authenticated symmet...
Dennis Hofheinz, Eike Kiltz
133
Voted
EUROCRYPT
2010
Springer
15 years 7 months ago
Bounded Key-Dependent Message Security
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval...
ACISP
2005
Springer
15 years 8 months ago
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...