Constant-Size structure-preserving signatures: generic constructions and simple assumptions

Authors:
Masayuki Abe;Melissa Chase;Bernardo David;Markulf Kohlweiss;Ryo Nishimaki;Miyako Ohkubo
Affiliations:
NTT Secure Platform Laboratories, Japan;Microsoft Research;University of Brasilia, Brazil;Microsoft Research;NTT Secure Platform Laboratories, Japan;Security Architecture Laboratory, NSRI, NICT, Japan
Venue:
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Year:
2012

Citing 35
Cited 1

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Public-key cryptosystems provably secure against chosen ciphertext attacks

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Nonmalleable Cryptography

SIAM Journal on Computing
Robust Non-interactive Zero Knowledge

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions

Journal of Cryptology
Anonymous Proxy Signatures

SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Pairings for cryptographers

Discrete Applied Mathematics
Universally Composable Adaptive Oblivious Transfer

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
Randomizable Proofs and Delegatable Anonymous Credentials

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Transferable Constant-Size Fair E-Cash

CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Group Encryption: Non-interactive Realization in the Standard Model

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Lower bounds for discrete logarithms and related problems

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
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
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient non-interactive proof systems for bilinear groups

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Structure-preserving signatures and commitments to group elements

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Practical adaptive oblivious transfer from simple assumptions

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Commuting signatures and verifiable encryption

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Optimal structure-preserving signatures in asymmetric bilinear groups

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Simulation-sound NIZK proofs for a practical language and constant size group signatures

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Foundations of group signatures: the case of dynamic groups

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Group signatures with efficient concurrent join

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
A framework for universally composable non-committing blind signatures

International Journal of Applied Cryptography
Round-optimal composable blind signatures in the common reference string model

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Fair blind signatures without random oracles

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Separating short structure-preserving signatures from non-interactive assumptions

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Malleable proof systems and applications

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Scalable group signatures with revocation

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Variants of waters' dual system primitives using asymmetric pairings

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient structure-preserving signature scheme from standard assumptions

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
A new hash-and-sign approach and structure-preserving signatures from DLIN

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks

Universally composable adaptive oblivious transfer (with access control) from standard assumptions

Proceedings of the 2013 ACM workshop on Digital identity management

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents efficient structure-preserving signature schemes based on assumptions as simple as Decisional-Linear. We first give two general frameworks for constructing fully secure signature schemes from weaker building blocks such as variations of one-time signatures and random-message secure signatures. They can be seen as refinements of the Even-Goldreich-Micali framework, and preserve many desirable properties of the underlying schemes such as constant signature size and structure preservation. We then instantiate them based on simple (i.e., not q-type) assumptions over symmetric and asymmetric bilinear groups. The resulting schemes are structure-preserving and yield constant-size signatures consisting of 11 to 17 group elements, which compares favorably to existing schemes relying on q-type assumptions for their security.