Sciweavers

239 search results - page 35 / 48
» A survey of certificateless encryption schemes and security ...
Sort
View
JOC
2007
129views more  JOC 2007»
13 years 8 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng
CCS
2007
ACM
14 years 3 months ago
Chosen-ciphertext secure proxy re-encryption
In a proxy re-encryption (PRE) scheme, a proxy is given special information that allows it to translate a ciphertext under one key into a ciphertext of the same message under a di...
Ran Canetti, Susan Hohenberger
ESORICS
2009
Springer
14 years 9 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 29 days ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
ACSW
2007
13 years 10 months ago
A Range Test Secure in the Active Adversary Model
In ACISP 2006, Peng et al proposed a novel range test technique, which tests whether the integer encrypted in a ciphertext is in an interval range. Their solution is more efficien...
Kun Peng, Ed Dawson