CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Short Signatures from the Weil Pairing
Journal of Cryptology
Digitally signed document sanitizing scheme based on bilinear maps
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Journal of Cryptology
Note: A simple transitive signature scheme for directed trees
Theoretical Computer Science
Efficient signature schemes supporting redaction, pseudonymization, and data deidentification
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Signing a Linear Subspace: Signature Schemes for Network Coding
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Security of Sanitizable Signatures Revisited
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Protection of Identity Information in Cloud Computing without Trusted Third Party
SRDS '10 Proceedings of the 2010 29th IEEE Symposium on Reliable Distributed Systems
Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Bounded vector signatures and their applications
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Homomorphic signatures for polynomial functions
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
A provably secure short transitive signature scheme from bilinear group pairs
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Secure network coding over the integers
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Fully homomorphic encryption with relatively small key and ciphertext sizes
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Unlinkability of sanitizable signatures
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Directed transitive signature scheme
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Transitive signatures: new schemes and proofs
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
With the popularity of cloud computing, how to securely authenticate a user while not releasing user's sensitive information becomes a challenge. In this paper, we introduce a slight homomorphic signature, which is suitable to implement an access controlling service in cloud computing. In slight homomorphic signature, each user in cloud computing who have a set of identity attributes, firstly computes a full signature on all his identity attributes, and sends it to a semi-trusted access controlling server. The access controlling server verifies the full signature for all identity attributes. After then, if the user wants to require a cloud service, which may have a special requirement on one of the identity attributes, the user only needs to securely send the cloud service's name to the access controlling server. The access controlling server which does not know the secret key can compute a partial signature on this special identity attribute, and then sends it to the cloud server for authentication. In the paper, we give a formal secure definition of this slight homomorphic signature, and construct a scheme from Boneh---Boyen signature. We prove that our scheme is secure under q-SDH problem with a weak adversary.