Secure acknowledgment aggregation and multisignatures with limited robustness

DOI10.1016/J.COMNET.2005.09.021MaRDI QIDQ2495488zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Claude Castelluccia, Stanislaw Jarecki, G. Tsudik, Jihye Kim

Publication date 30 June 2006

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2005.09.021

zbMATH Keywords

cryptographysignaturesacknowledgmentsaggregated signaturesrobust protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Security in Communication Networks
• Distributed Computing - IWDC 2004
• Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
• Tightly secure non-interactive multisignatures in the plain public key model

Cited in

(6)

• Security in Communication Networks
• Distributed Computing - IWDC 2004
• Robust subgroup multi-signatures for consensus
• Non-interactive multisignatures in the plain public-key model with efficient verification
• MQ Aggregate Signature Schemes with Exact Security Based on UOV Signature
• TTLed random walks for collaborative monitoring in mobile and social networks

This page was built for publication: Secure acknowledgment aggregation and multisignatures with limited robustness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495488)