skip to main content
10.1145/1966913.1966967acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
short-paper

Server-aided signatures verification secure against collusion attack

Published: 22 March 2011 Publication History

Abstract

Wireless handheld devices which support e-mail and web browsing are increasingly popular. The authenticity of the information received is important, especially for business uses. In server-aided verification (SAV), a substantial part of the verification computation can be offloaded to a powerful but possibly untrusted server. This allows resource-constrained devices to enjoy the security guarantees provided by cryptographic schemes, such as pairing-based signatures, which may be too heavyweight to verify otherwise.
To gain unfair advantage, an adversary may bribe the server to launch various kinds of attacks --- to convince that an invalid signature held by a client is a valid one (say for providing false information or repudiable commitment) or to claim that a valid signature is invalid (say for spoiling the offer provided by an opponent). However, these concerns are not properly captured by existing security models.
In this paper, we provide a generic pairing-based SAV protocol. Compared with the protocol of Girault and Lefranc in Asiacrypt '05, ours provides a higher level of security yet applicable to a much wider class of pairing-based cryptosystems. In particular, it suggests SAV protocols for short signatures in the standard model and aggregate signatures which have not been studied before.

References

[1]
Dan Boneh and Xavier Boyen. Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups. J. Cryptology, 21(2):149--177, 2008.
[2]
Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In EUROCRYPT, pages 416--432, 2003.
[3]
Dan Boneh, Ben Lynn, and Hovav Shacham. Short Signatures from the Weil Pairing. J. Cryptology, 17(4):297--319, 2004.
[4]
Benoit Chevallier-Mames, Jean-Sebastien Coron, Noel McCullagh, David Naccache, and Michael Scott. Secure Delegation of Elliptic-Curve Pairing. Cryptology ePrint Archive, 2005/150, 2005.
[5]
Sherman S. M. Chow, Joseph K. Liu, and Jianying Zhou. Identity-based online/offline key encapsulation and encryption. In ASIACCS, 2011. To appear.
[6]
Sherman S. M. Chow, Siu-Ming Yiu, and Lucas Chi Kwong Hui. Efficient Identity Based Ring Signature. In ACNS, pages 499--512, 2005.
[7]
Cheng-Kang Chu, Wen Tao Zhu, Sherman S. M. Chow, Jianying Zhou, and Robert H. Deng. Secure mobile subscription of sensor-encrypted data. In ASIACCS, 2011. To appear.
[8]
Anna Lisa Ferrara, Matthew Green, Susan Hohenberger, and Michael �stergaard Pedersen. Practical Short Signature Batch Verification. In CT-RSA, pages 309--324, 2009.
[9]
Marc Girault and David Lefranc. Server-Aided Verification: Theory and Practice. In ASIACRYPT, pages 605--623, 2005.
[10]
Bo Gyeong Kang, Moon Sung Lee, and Je Hong Park. Efficient Delegation of Pairing Computation. Cryptology ePrint Archive, Report 2005/259, 2005.
[11]
Patrick P. Tsang, Sherman S. M. Chow, and Sean W. Smith. Batch Pairing Delegation. In IWSEC, pages 74--90, 2007.
[12]
Zhiwei Wang, Licheng Wang, Yixian Yang, and Zhengming Hu. Comment on Wu et al.'s Server-Aided Verification Signature Schemes. Intl. J. of Network Sec., 10(2):158--160, 2010.
[13]
Wei Wu, Yi Mu, Willy Susilo, and Xinyi Huang. Server-Aided Verification Signatures: Definitions and New Constructions. In ProvSec, pages 141--155, 2008.
[14]
Fangguo Zhang, Reihaneh Safavi-Naini, and Willy Susilo. An Efficient Signature Scheme from Bilinear Pairings and Its Applications. In PKC, pages 277--290, 2004.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASIACCS '11: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
March 2011
527 pages
ISBN:9781450305648
DOI:10.1145/1966913
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 March 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. authenticity
  2. collusion attack
  3. delegation
  4. pairings
  5. server-aided computation
  6. signatures
  7. weak computational device

Qualifiers

  • Short-paper

Conference

ASIA CCS '11
Sponsor:

Acceptance Rates

ASIACCS '11 Paper Acceptance Rate 35 of 217 submissions, 16%;
Overall Acceptance Rate 418 of 2,322 submissions, 18%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2019)A Short Server-Aided Certificateless Aggregate Multisignature Scheme in the Standard ModelSecurity and Communication Networks10.1155/2019/34248902019Online publication date: 18-Mar-2019
  • (2017)Noninteractive Verifiable Outsourcing Algorithm for Bilinear Pairing with Improved CheckabilitySecurity and Communication Networks10.1155/2017/48928142017Online publication date: 1-Jan-2017
  • (2016)Introduction to Secure Outsourcing ComputationSynthesis Lectures on Information Security, Privacy, and Trust10.2200/S00701ED1V01Y201602SPT0168:2(1-93)Online publication date: 19-Feb-2016
  • (2016)New algorithms for verifiable outsourcing of bilinear pairings可完全验证的双线性对运算外包算法Science China Information Sciences10.1007/s11432-016-5550-859:9Online publication date: 23-Aug-2016
  • (2015)Efficient algorithms for secure outsourcing of bilinear pairingsTheoretical Computer Science10.1016/j.tcs.2014.09.038562:C(112-121)Online publication date: 11-Jan-2015
  • (2012)A pre-computable signature scheme with efficient verification for RFIDProceedings of the 8th international conference on Information Security Practice and Experience10.1007/978-3-642-29101-2_1(1-16)Online publication date: 9-Apr-2012
  • (2011)Secure mobile subscription of sensor-encrypted dataProceedings of the 6th ACM Symposium on Information, Computer and Communications Security10.1145/1966913.1966943(228-237)Online publication date: 22-Mar-2011
  • (2011)Identity-based online/offline key encapsulation and encryptionProceedings of the 6th ACM Symposium on Information, Computer and Communications Security10.1145/1966913.1966922(52-60)Online publication date: 22-Mar-2011

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media