Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
8 of
8
Efficient Unlinkable Sanitizable Signatures from Signatures with
"... Abstract. Sanitizable signature schemes are a type of malleable signatures where the signer grants a designated third party, called the sanitizer, signing rights in the sense that the sanitizer can modify designated parts and adapt the signature accordingly. Ateniese et al. (ESORICS 2005) introduced ..."
Abstract
- Add to MetaCart
and gave a generic construction based on group signatures that have a certain structure. Here, we present the first efficient instantiation of unlinkable sanitizable signatures. Our construction is based on a novel type of signature schemes with rerandomizable keys. Intuitively, this property allows
Rethinking Privacy for Extended Sanitizable Signatures and a Black-Box Construction of Strongly Private Schemes?
"... Abstract. Sanitizable signatures, introduced by Ateniese et al. at ESOR-ICS’05, allow to issue a signature on a message where certain predefined message blocks may later be changed (sanitized) by some dedicated party (the sanitizer) without invalidating the original signature. With sanitiz-able sign ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
do not capture privacy in the sense of the original definition of sanitizable signatures. That is, if a scheme is private in this model it is not guaranteed that the sets of al-lowed modifications remain concealed. To this end, we review a stronger notion of privacy, i.e., (strong) unlinkability
Pseudorandom Signatures
"... Abstract. We develop a three-level hierarchy of privacy notions for (unforgeable) digital signatures, starting with existing notions of anonymity and confidentiality, whose independence we prove formally. The ultimate privacy goal in our hierarchy is pseudorandomness: signatures with this property h ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
hide the entire information about the signing process and they cannot be recognized as signatures when transmitted over a public network. This implies very strong unlinkability guarantees across different signers and even different signing algorithms and gives rise to new forms of private public-key
Privacy Protection Using Unobservablity and Unlink ability against Wormhole Attacks in Manet
"... ABSTRACT: An efficient privacy-preserving routing protocol USOR that achieves content un-observability by employing anonymous key establishment based on group signature. The setup of USOR is simple: In privacy-preserving communications can largely be divided into two categories: cryptosystem-based t ..."
Abstract
- Add to MetaCart
ABSTRACT: An efficient privacy-preserving routing protocol USOR that achieves content un-observability by employing anonymous key establishment based on group signature. The setup of USOR is simple: In privacy-preserving communications can largely be divided into two categories: cryptosystem
An Improved and Efficient Multipath Anonymous Routing in MANET
"... Abstract — unspecified communications are momentous for many applications of the mobile ad hoc networks (MANETs) deployed in opponent environments. The most important necessity on the network is to afford unidentifiability and unlinkability for mobile nodes and their traffics. Eventhough a number of ..."
Abstract
- Add to MetaCart
routing protocol, i.e., authenticated anonymous secure routing(AASR) with multipath to assure requirement and defend the attack. In this protocol the route request packets are authenticated by group signature, to protect the prospective active attacks without disclosing the node identities. The key
Improved Signcryption from q-Diffie-Hellman Problems
- in 4h Conference on Security in Communication Networks ’04 (SCN’04), Vol. 3352 of LNCS
, 2004
"... Abstract. This paper proposes a new public key authenticated encryption (signcryption) scheme based on the hardness of q-Diffie-Hellman problems in Gap Diffie-Hellman groups. This new scheme is quite efficient: the signcryption operation has almost the same cost as an El Gamal encryption while the r ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
Abstract. This paper proposes a new public key authenticated encryption (signcryption) scheme based on the hardness of q-Diffie-Hellman problems in Gap Diffie-Hellman groups. This new scheme is quite efficient: the signcryption operation has almost the same cost as an El Gamal encryption while
unknown title
"... Abstract — Group Signature scheme allows members of a group to sign messages on behalf of the group, such that the resulting signature does not reveal the identity of the signer. Signatures can be verified with respect to a single group public key. In case of dispute, only a designated group manager ..."
Abstract
- Add to MetaCart
Abstract — Group Signature scheme allows members of a group to sign messages on behalf of the group, such that the resulting signature does not reveal the identity of the signer. Signatures can be verified with respect to a single group public key. In case of dispute, only a designated group
ii List of Publications
, 2014
"... pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios ..."
Abstract
- Add to MetaCart
pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios
