A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Verifiable encryption of digital signatures and applications
ACM Transactions on Information and System Security (TISSEC)
The random oracle methodology, revisited
Journal of the ACM (JACM)
A Brief Look at Pairings Based Cryptography
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
SWIFFT: A Modest Proposal for FFT Hashing
Fast Software Encryption
Post Quantum Cryptography
Towards practical lattice-based cryptography
Towards practical lattice-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
Verifiably Encrypted Signatures from RSA without NIZKs
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Optimistic fair exchange in a multi-user setting
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
Asymptotically efficient lattice-based digital signatures
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On ideal lattices and learning with errors over rings
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Sequential aggregate signatures and multisignatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
Efficient CDH-based verifiably encrypted signatures with optimal bandwidth in the standard model
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
A generic construction of accountable decryption and its applications
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifiability. With our work, we propose two generic constructions based on Merkle authentication trees that do not require non-interactive zero-knowledge proofs (NIZKs) for maintaining verifiability. Both are stateful and secure in the standard model. Furthermore, we extend the specification for VES, bringing it closer to real-world needs. We also argue that statefulness can be a feature in common business scenarios. Our constructions rely on the assumption that CPA (even slightly weaker) secure encryption, "maskable" CMA secure signatures, and collision resistant hash functions exist. "Maskable" means that a signature can be hidden in a verifiable way using a secret masking value. Unmasking the signature is hard without knowing the secret masking value. We show that our constructions can be instantiated with a broad range of efficient signature and encryption schemes, including two lattice-based primitives. Thus, VES schemes can be based on the hardness of worstcase lattice problems, making them secure against subexponential and quantum-computer attacks. Among others, we provide the first efficient pairing-free instantiation in the standard model.