Results 211 to 220 of about 49,363 (243)

Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles

Journal of Cryptology, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, Steve, Ostrovsky, Rafail, Sahai, Amit, Shacham, Hovav, Waters, Brent   +4 more
openaire   +1 more source

Sequential aggregate signatures for wireless routing protocols

IEEE Wireless Communications and Networking Conference, 2005, 2005
Sequential aggregate signature, first introduced and formalized by A. Lysyanskaya et al. (see EUROCRYPT 2004, p.74-90, 2004), is emerging as a useful tool to ensure routing security and at the same time to improve performance. We propose a new mechanism to construct sequential aggregate signatures based on the cipher block chaining (CBC) mode, which is
null Huafei Zhu, null Feng Bao, null Tieyan Li, null Yongdong Wu   +3 more
openaire   +1 more source

Secure and Traceable Attribute-Based Sequential Aggregate Signature

2021
Attribute-based signatures allow a signer with a set of attributes to anonymously sign a message about some signature policy. However, in the environments that require accountability and preventing abuse, the anonymity revocation function is vital important and necessary. In order to meet the requirements that multiple different authorized participants
Ruili Yang, Jiageng Chen, Shangle Li
openaire   +1 more source

FAS: Forward secure sequential aggregate signatures for secure logging

Information Sciences, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jihye Kim, Hyunok Oh
openaire   +2 more sources

Practical forward secure sequential aggregate signatures

Proceedings of the 2008 ACM symposium on Information, computer and communications security, 2008
A forward secure sequential aggregate (FssAgg) signature scheme allows a signer to iteratively combine signatures generated in different time intervals - and with different keys - into a single constant-size signature. Such a signature offers forward security, storage/communication efficiency, as well as overall integrity of the signed messages. FssAgg
openaire   +1 more source

Lattice-based sequential aggregate signatures with lazy verification

The Journal of China Universities of Posts and Telecommunications, 2015
Abstract This paper proposes the first lattice-based sequential aggregate signature (SAS) scheme with lazy verification that is provably secure in the random oracle model. As opposed to large integer factoring and discrete logarithm based systems, the security of the construction relies on worst-case lattice problem, namely, under the small integer ...
Zhang Yanhua, Hu Yupu, Jiang Mingming, Xue Lili   +3 more
openaire   +1 more source

A Practical Lattice-Based Sequential Aggregate Signature

2019
In this work, we construct a lattice-based efficient Sequential Aggregate Signature (SAS) scheme that is provably secure in standard ideal cipher model with some slight changes. This framework is inspired by the scheme of Gentry et al. at PKC 2018 which presented trapdoor-permutation-based sequential aggregate signatures.
Wang, Zhipeng, Wu, Qianhong
openaire   +1 more source

New Identity-Based Sequential Aggregate Signature Scheme from RSA

2013 International Symposium on Biometrics and Security Technologies, 2013
An identity-based sequential aggregate signature (IBSAS) scheme provides a shorter aggregate signature for multiple signers in which each signer has signed his/her own message and all generated signatures are aggregated in sequence. During aggregate signature verification process, a verifier can identify the generated order and the validity of ...
Jia-Lun Tsai, Nai-Wei Lo, Tzong-Chen Wu
openaire   +1 more source

Universal forgery of the identity-based sequential aggregate signature scheme

Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, 2009
At CCS'07, a novel identity-based sequential aggregate signature scheme was proposed and the security of the scheme was proven under the hardness assumption of a new computational problem called modified LRSW problem. In the paper, unfortunately, we show that the scheme is universally forgeable, i.e., anyone can generate forged signatures on any ...
Jung Yeon Hwang, Dong Hoon Lee, Moti Yung   +2 more
openaire   +1 more source

Sequential Aggregate Signatures and Multisignatures in the Plain Public Key Model

Chinese Journal of Electronics, 2015
At Eurocrypt’06, Lu et al. presented the first Sequential aggregate signature (SAS) provably secure without random oracles. The drawback of their scheme is that users need long public keys and the security model makes the Knowledge of secure key (KOSK) assumption.
Xuhua Zhou, Junzuo Lai, Shengli Liu, Kefei Chen   +3 more
openaire   +1 more source