Programmable Hash Functions and Their Applications
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
On the Equivalence of Generic Group Models
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Distributed Attribute-Based Encryption
Information Security and Cryptology --- ICISC 2008
On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Divisible On-Line/Off-Line Signatures
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
An Efficient Identity-Based Online/Offline Encryption Scheme
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Proceedings of the 16th ACM conference on Computer and communications security
Twin Signature Schemes, Revisited
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Anonymous Signatures Revisited
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Selectable k-Times Relaxed Anonymous Authentication Scheme
Information Security Applications
Time-selective convertible undeniable signatures with short conversion receipts
Information Sciences: an International Journal
Secure provenance: the essential of bread and butter of data forensics in cloud computing
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Practical ID-based encryption for wireless sensor network
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length
International Journal of Applied Cryptography
Secret handshakes with revocation support
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Provably secure convertible undeniable signatures with unambiguity
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Group signature implies PKE with non-interactive opening and threshold PKE
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
ProvSec'10 Proceedings of the 4th international conference on Provable security
ProvSec'10 Proceedings of the 4th international conference on Provable security
Shorter verifier-local revocation group signature with backward unlinkability
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Optimal authenticated data structures with multilinear forms
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Identity-based online/offline key encapsulation and encryption
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Server-aided signatures verification secure against collusion attack
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Tight proofs for signature schemes without random oracles
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Two-output secure computation with malicious adversaries
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Fully secure cipertext-policy hiding CP-ABE
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Controversy corner: Improving security of q-SDH based digital signatures
Journal of Systems and Software
A signature scheme with efficient proof of validity
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Double-trapdoor anonymous tags for traceable signatures
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Online/offline identity-based signcryption revisited
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Redesigning group key exchange protocol based on bilinear pairing suitable for various environments
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Optimal verification of operations on dynamic sets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fair and abuse-free contract signing protocol from Boneh-Boyen signature
EuroPKI'10 Proceedings of the 7th European conference on Public key infrastructures, services and applications
Group signatures are suitable for constrained devices
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
How to aggregate the CL signature scheme
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Towards restricting plaintext space in public key encryption
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Universal designated verifier signature without delegatability
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
New extensions of pairing-based signatures into universal designated verifier signatures
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
ID-Based aggregate signatures from bilinear pairings
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Dynamic attribute-based signcryption without random oracles
International Journal of Applied Cryptography
Fuzzy biometric signcryption scheme with bilinear pairings in the standard model
PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
Online/Offline ring signature scheme
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Dynamic attribute-based signcryption without random oracles
International Journal of Applied Cryptography
On the joint security of encryption and signature, revisited
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Cryptography secure against related-key attacks and tampering
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Short signatures from weaker assumptions
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Group signature with constant revocation costs for signers and verifiers
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Security and Communication Networks
A pre-computable signature scheme with efficient verification for RFID
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
All-But-Many lossy trapdoor functions
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Security and Communication Networks
Strong security from probabilistic signature schemes
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient network coding signatures in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Improved security for linearly homomorphic signatures: a generic framework
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
A revocable group signature scheme with the property of hiding the number of revoked users
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Group signatures with controllable linkability for dynamic membership
Information Sciences: an International Journal
Efficient two-move blind signatures in the common reference string model
ISC'12 Proceedings of the 15th international conference on Information Security
One-Move convertible nominative signature in the standard model
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Efficient structure-preserving signature scheme from standard assumptions
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Information Sciences: an International Journal
Server-aided signatures verification secure against collusion attack
Information Security Tech. Report
Fair exchange of short signatures without trusted third party
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Signatures of correct computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Protecting privacy by sanitizing personal data: a new approach to anonymous credentials
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
A group signature scheme with unbounded message-dependent opening
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
How to achieve non-repudiation of origin with privacy protection in cloud computing
Journal of Computer and System Sciences
Thinking inside the BLAC box: smarter protocols for faster anonymous blacklisting
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Batch proofs of partial knowledge
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Efficient signatures of knowledge and DAA in the standard model
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
An ID-based online/offline signature scheme without random oracles for wireless sensor networks
Personal and Ubiquitous Computing
Slight Homomorphic Signature for Access Controlling in Cloud Computing
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in groups equipped with an efficient bilinear map, or, more generally, an algorithm for the Decision Diffie-Hellman problem. The security of our scheme depends on a new intractability assumption we call Strong Diffie-Hellman (SDH), by analogy to the Strong RSA assumption with which it shares many properties. Signature generation in our system is fast and the resulting signatures are as short as DSA signatures for comparable security. We give a tight reduction proving that our scheme is secure in any group in which the SDH assumption holds, without relying on the random oracle model.