Strongly unforgeable signatures based on computational diffie-hellman

Authors:
Dan Boneh;Emily Shen;Brent Waters
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;SRI International, Palo Alto, CA
Venue:
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Year:
2006

Citing 21
Cited 52

Two remarks concerning the Goldwasser-Micali-Rivest signature scheme

Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Universal one-way hash functions and their cryptographic applications

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Signature schemes based on the strong RSA assumption

ACM Transactions on Information and System Security (TISSEC)
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Nonmalleable Cryptography

SIAM Journal on Computing
On the Exact Security of Full Domain Hash

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
New Generation of Secure and Practical RSA-Based Signatures

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient Construction of (Distributed) Verifiable Random Functions

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Verifiable Random Functions

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Short Signatures from the Weil Pairing

Journal of Cryptology
The exact security of digital signatures-how to sign with RSA and Rabin

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Collision free hash functions and public key signature schemes

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A signature scheme as secure as the Diffie-Hellman problem

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A secure signature scheme from bilinear maps

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Provably secure ciphertext policy ABE

Proceedings of the 14th ACM conference on Computer and communications security
Hierarchical identity based group signature with enhanced privacy of the signers

AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
Generic Transformation to Strongly Unforgeable Signatures

ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
General Conversion for Obtaining Strongly Existentially Unforgeable Signatures

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions

IEICE - Transactions on Information and Systems
Strong unforgeability in group signature schemes

Computer Standards & Interfaces
Authenticated wireless roaming via tunnels: making mobile guests feel at home

Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Strongly Unforgeable ID-Based Signatures without Random Oracles

ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Strong Anonymous Signatures

Information Security and Cryptology
How to Prove Security of a Signature with a Tighter Security Reduction

ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Efficient Constructions of Signcryption Schemes and Signcryption Composability

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A generic construction for universally-convertible undeniable signatures

CANS'07 Proceedings of the 6th international conference on Cryptology and network security
A CDH-based strongly unforgeable signature without collision resistant hash function

ProvSec'07 Proceedings of the 1st international conference on Provable security
Formal security treatments for signatures from identity-based encryption

ProvSec'07 Proceedings of the 1st international conference on Provable security
Security of invertible media authentication schemes revisited

IH'07 Proceedings of the 9th international conference on Information hiding
Formal definition and construction of nominative signature

ICICS'07 Proceedings of the 9th international conference on Information and communications security
Generic security-amplifying methods of ordinary digital signatures

ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Strongly unforgeable ID-based signatures without random oracles

International Journal of Applied Cryptography
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length

International Journal of Applied Cryptography
Short generic transformation to strongly unforgeable signature in the standard model

ESORICS'10 Proceedings of the 15th European conference on Research in computer security
One-time signatures and Chameleon hash functions

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
On-line non-transferable signatures revisited

PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Signcryption with non-interactive non-repudiation without random oracles

Transactions on computational science X
Generic transformation from weakly to strongly unforgeable signatures

Journal of Computer Science and Technology
Strongly unforgeable proxy signature scheme secure in the standard model

Journal of Systems and Software
Efficient generic constructions of signcryption with insider security in the multi-user setting

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Non-transferable user certification secure against authority information leaks and impersonation attacks

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
A revocation scheme preserving privacy

Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
General conversion for obtaining strongly existentially unforgeable signatures

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Unlinkability of sanitizable signatures

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Universal designated verifier signatures without random oracles or non-black box assumptions

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Chosen ciphertext security from identity-based encryption without strong condition

IWSEC'06 Proceedings of the 1st international conference on Security
A practical and tightly secure signature scheme without hash function

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
How to strengthen any weakly unforgeable signature into a strongly unforgeable signature

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Strongly secure certificateless short signatures

Journal of Systems and Software
Generic security-amplifying methods of ordinary digital signatures

Information Sciences: an International Journal
All-But-Many lossy trapdoor functions

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On the joint security of signature and encryption schemes under randomness reuse: efficiency and security amplification

ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Efficient signcryption in the standard model

Concurrency and Computation: Practice & Experience
An information aggregation scheme of multi-node in ubiquitous sensor networks

ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
ID based signcryption scheme in standard model

ProvSec'12 Proceedings of the 6th international conference on Provable Security
Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model

Security and Communication Networks
Computing on authenticated data: new privacy definitions and constructions

ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Proof of possession for cloud storage via lagrangian interpolation techniques

NSS'12 Proceedings of the 6th international conference on Network and System Security
Using SMT solvers to automate design tasks for encryption and signature schemes

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Constructing practical signcryption KEM from standard assumptions without random oracles

ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Broadcast encryption based non-interactive key distribution in MANETs

Journal of Computer and System Sciences
Signcryption schemes with threshold unsigncryption, and applications

Designs, Codes and Cryptography
Simultaneous authentication and secrecy in identity-based data upload to cloud

Cluster Computing
A systematic method to design strong designated verifier signature without random oracles

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message m, the adversary cannot produce a new signature on m. Strongly unforgeable signatures are used for constructing chosen-ciphertext secure systems and group signatures. Current efficient constructions in the standard model (i.e. without random oracles) depend on relatively strong assumptions such as Strong-RSA or Strong-Diffie-Hellman. We construct an efficient strongly unforgeable signature system based on the standard Computational Diffie-Hellman problem in bilinear groups.