Article

Brief announcement: a flexible framework for secret handshakes

Authors:

Gene Tsudik,

Shouhuai XuAuthors Info & Claims

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Page 39

https://doi.org/10.1145/1073814.1073820

Published: 17 July 2005 Publication History

Get Access

Abstract

Secret handshakes offer anonymous and unobservable authentication and serve as an important tool in the arsenal of privacy-preserving techniques. Prior research focused on 2-party secret handshakes with one-time credentials. This paper breaks new ground on two accounts: (1) we obtain secure and efficient secret handshakes with reusable credentials, and (2) we provide the first treatment of multi-party secret handshakes.

References

[1]

D. Balfanz, G. Durfee, N. Shankar, D. Smetters, J. Staddon, and H. Wong. Secret Handshakes from Pairing-Based Key Agreements, IEEE Symposium on Security and Privacy 2003.

Digital Library

Google Scholar

[2]

C. Castelluccia, S. Jarecki, and G. Tsudik. Secret Handshakes from CA-Oblivious Encryption, ASIACRYPT 2004.

Crossref

Google Scholar

[3]

S. Xu and M. Yung. k-anonymous Secret Handshakes with Reusable Credentials, ACM CCS 2004.

Digital Library

Google Scholar

[4]

G. Tsudik and S. Xu, A Flexible Framework for Secret Handshakes, Cryptology ePrint Archive: Report 2005/034.

Google Scholar

Cited By

View all

Hou LLai JLiu L(2016)Secret Handshakes with Dynamic Expressive Matching PolicyProceedings, Part I, of the 21st Australasian Conference on Information Security and Privacy - Volume 972210.1007/978-3-319-40253-6_28(461-476)Online publication date: 4-Jul-2016
https://dl.acm.org/doi/10.1007/978-3-319-40253-6_28
Ma DSoriente C(2011)Building Trust for lambda-Congenial Secret GroupsProceedings of the 2011 International Conference on Broadband and Wireless Computing, Communication and Applications10.1109/BWCCA.2011.35(222-229)Online publication date: 26-Oct-2011
https://dl.acm.org/doi/10.1109/BWCCA.2011.35
Kawai YTanno SKondo TYoneyama KKunihiro NOhta K(2009)Extension of Secret Handshake Protocols with Multiple Groups in Monotone ConditionInformation Security Applications10.1007/978-3-642-00306-6_12(160-173)Online publication date: 18-Feb-2009
https://dl.acm.org/doi/10.1007/978-3-642-00306-6_12
Show More Cited By

Index Terms

Brief announcement: a flexible framework for secret handshakes
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Recommendations

A flexible framework for secret handshakes
PET'06: Proceedings of the 6th international conference on Privacy Enhancing Technologies

In the society increasingly concerned with the erosion of privacy, privacy-preserving techniques are becoming very important. This motivates research in cryptographic techniques offering built-in privacy. A secret handshake is a protocol whereby ...
Brief announcement: secret handshakes from CA-oblivious encryption
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Secret handshake protocols were recently introduced by Balfanz, et al. [1] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member cannot tell, by engaging in the handshake protocol, ...
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02: Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

We introduce the notion of a dynamic accumulator. An accumulator scheme allows one to hash a large set of inputs into one short value, such that there is a short proof that a given input was incorporated into this value. A dynamic accumulator allows one ...

Comments

Information & Contributors

Information

Published In

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

July 2005

364 pages

ISBN:1581139942

DOI:10.1145/1073814

General Chair:
Marcos Aguilera
HP Labs
,
Program Chair:
James Aspnes
Yale University

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

July 17 - 20, 2005

NV, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
223
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hou LLai JLiu L(2016)Secret Handshakes with Dynamic Expressive Matching PolicyProceedings, Part I, of the 21st Australasian Conference on Information Security and Privacy - Volume 972210.1007/978-3-319-40253-6_28(461-476)Online publication date: 4-Jul-2016
https://dl.acm.org/doi/10.1007/978-3-319-40253-6_28
Ma DSoriente C(2011)Building Trust for lambda-Congenial Secret GroupsProceedings of the 2011 International Conference on Broadband and Wireless Computing, Communication and Applications10.1109/BWCCA.2011.35(222-229)Online publication date: 26-Oct-2011
https://dl.acm.org/doi/10.1109/BWCCA.2011.35
Kawai YTanno SKondo TYoneyama KKunihiro NOhta K(2009)Extension of Secret Handshake Protocols with Multiple Groups in Monotone ConditionInformation Security Applications10.1007/978-3-642-00306-6_12(160-173)Online publication date: 18-Feb-2009
https://dl.acm.org/doi/10.1007/978-3-642-00306-6_12
Xu SYung M(2007)K-anonymous multi-party secret handshakesProceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security10.5555/1785594.1785608(72-87)Online publication date: 12-Feb-2007
https://dl.acm.org/doi/10.5555/1785594.1785608
Zhou LSusilo WMu Y(2007)New construction of group secret handshakes based on pairingsProceedings of the 9th international conference on Information and communications security10.5555/1785001.1785004(16-30)Online publication date: 12-Dec-2007
https://dl.acm.org/doi/10.5555/1785001.1785004
Zhou LSusilo WMu Y(2007)New Construction of Group Secret Handshakes Based on PairingsInformation and Communications Security10.1007/978-3-540-77048-0_2(16-30)Online publication date: 2007
https://doi.org/10.1007/978-3-540-77048-0_2
Jarecki SLiu X(2007)Unlinkable Secret Handshakes and Key-Private Group Key Management SchemesProceedings of the 5th international conference on Applied Cryptography and Network Security10.1007/978-3-540-72738-5_18(270-287)Online publication date: 5-Jun-2007
https://dl.acm.org/doi/10.1007/978-3-540-72738-5_18
Yamashita NTanaka K(2007)Secret Handshake with Multiple GroupsInformation Security Applications10.1007/978-3-540-71093-6_26(339-348)Online publication date: 2007
https://doi.org/10.1007/978-3-540-71093-6_26
Yamashita NTanaka K(2006)Secret handshake with multiple groupsProceedings of the 7th international conference on Information security applications: PartI10.5555/1764677.1764711(339-348)Online publication date: 28-Aug-2006
https://dl.acm.org/doi/10.5555/1764677.1764711
Jarecki SKim JTsudik G(2006)Authentication for paranoidsProceedings of the 4th international conference on Applied Cryptography and Network Security10.1007/11767480_22(325-339)Online publication date: 6-Jun-2006
https://dl.acm.org/doi/10.1007/11767480_22

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A flexible framework for secret handshakes

Brief announcement: secret handshakes from CA-oblivious encryption

Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations