Article

SELS: a secure e-mail list service

Authors:

Himanshu Khurana,

Rafael BonillaAuthors Info & Claims

SAC '05: Proceedings of the 2005 ACM symposium on Applied computing

Pages 306 - 313

https://doi.org/10.1145/1066677.1066752

Published: 13 March 2005 Publication History

Abstract

Exchange of private information content among a large number of users via E-mail List Services is becoming increasingly common. In this paper we address security requirements in that setting and develop a new protocol, SELS (a Secure E-mail List Service) that provides confidentiality, integrity, and authentication for e-mails exchanged via lists. In addition, SELS also protects against the use of lists for e-mail spamming. We have developed a prototype of SELS in Java, and integrated it with the Eudora e-mail client.

References

[1]

M. Abadi, N. Glew, B. Horne, B. Pinkas, "Certified Email with a Light On-line Trusted Third Party:Design and Implementation", in proceedings of the 11th International World Wide Web Conference, May 2002.

Digital Library

[2]

M. Abadi, A. Birrell, M. Burrows, F. Dabek, and T. Wobber, "Bankable Postage for Network Services", in Proceedings of the 8th Asian Computing Science Conference, Mumbai, India, December 2003.

[3]

J. Allen, The CERT Guide to System and Network Security Practices, Carnegie Mellon Software Engineering Institute, Addison Wesley, Indianapolis, 2001. ISBN 0-2-1-73723-X.

[4]

I. Androutsopoulos et al., "An Experimental Comparison of Naive Bayesian and Keyword-Based Anti-Spam Filtering with Personal E-mail Messages", in Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Greece, July 2000.

Digital Library

[5]

R. Anderson and R. Needham, "Robustness principles for public key protocols", in Advances in Cryptology (CRYPTO 95), 1995.

Digital Library

[6]

M. Bellare, R. Canetti, and H. Krawczyk, "Message authentication using hash functions: The HMAC construction", RSA Laboratories' CryptoBytes, Vol. 2, No. 1, Spring 1996.

[7]

M. Blaze, G. Bleumer, and M. Strauss, "Divertible protocols and atomic proxy cryptography", in Eurocrypt'98, LNCS 1403, Springer-Verlag, 1998.

[8]

C. Blundo, S. Cimato, and R. D. Prisco, "Certified Email: Design and Implementation of a New Optimistic Protocol", in proceedings of the Eighth IEEE International Symposium on Computers and Communications, June 30 - July 03, Turkey, 2003.

Digital Library

[9]

D. Boneh, X. Ding, G. Tsudik and B. Wong, "Fast Revocation of Security Capabilities", in Proceedings of the Usenix Security Symposium, August 2001.

Digital Library

[10]

D. Boneh and M. Franklin, "Identity based encryption from the Weil pairing", SIAM Journal of Computing, Vol. 32, No. 3, pp. 586--615, 2003.

Digital Library

[11]

Catalist, the official catalog of LISTSERV lists, http://www.Isoft.com/catalist.html.

[12]

R. Clayton and M. Bond, "Experience Using a Low-Cost FPGA Design to Crack DES Keys", in Proceedings of the Workshop on Cryptographic Hardware and Embedded Systems (CHES), 2002.

Digital Library

[13]

L. Cranor and B. LaMacchia, "Spam!", Communications of the ACM 41, 8 (August 1998), 74--83.

Digital Library

[14]

X. Ding and G. Tsudik, "Simple Identity-Based Cryptography with Mediated RSA", in Proceedings of the RSA Conference, Cryptographer's Track, 2003.

Digital Library

[15]

C. Dwork, M. Naor, "Pricing via Processing or Combatting Junk Mail", in Proceedings of CRYPTO'92, 1993, pp. 137--147.

Digital Library

[16]

C. Dwork, A. Goldberg, and M. Naor, "On Memory-Bound Functions for Fighting Spam", in advances of Cryptology (CRYPTO 2003,) August 2003.

[17]

E. Gabber et al., "Curbing junk e-mail via secure classification", in Proceedings of Financial Cryptography, 1998.

Digital Library

[18]

T. E. Gamal, "A Public Key Cryptosystem and a Signature Scheme Based on the Discrete Logarithm", IEEE Transactions of Information Theory, pages 31(4): 469--472, 1985.

Digital Library

[19]

The GNU Privacy Guard, http://gnupg.org.

[20]

J. loannidis, "Fighting spam by encapsulating policy in email addresses", in Proceedings of the Symposium on Network and Distributed Systems Security, 2003.

[21]

A. Ivan and Y. Dodis, "Proxy Cryptography Revisited", in Proceedings of the Network and Distributed System Security Symposium (NDSS), February 2003.

[22]

Y. Kim, A. Perrig and G. Tsudik, "Simple and Fault-Tolerant Key Agreement for Dynamic Collaborative Groups", in Proceedings of 7th ACM Conference on Computer and Communication Security (CCS), 2000.

Digital Library

[23]

J. Linn, "Privacy Enhancement for Internet Electronic Mail: Part I: Message Encryption and Authentication Procedures", IETF PEM WG RFC 21, 1993.

[24]

LISTSERV, http://www.Isoft.com.

[25]

T. Loder, M. V. Alstyne, and R. Wash, "An Economic Answer to Unsolicited Communication", in proceedings of the 5th ACM conference on Electronic Commerce, May 2004.

Digital Library

[26]

Mailman, the GNU mailing list manager. http://www.list.org.

[27]

Majordomo, http://www.greatcircle.com/majordomo.

[28]

M. Mambo and E. Okamoto, "Proxy Cryptosystems: Delegation of the Power to Decrypt Ciphertexts", IEICE Transactions on Fundamentals, vol. E80-A, No. 1, 1997.

[29]

S. Mittra, "lolus: A Framework for Scalable Secure Multicasting", in proceedings of ACM SIGCOMM 1997.

Digital Library

[30]

Ostermiller Java Utilities, http://ostermiller.org/utils.

[31]

T. Tompkins and D. Handley, "Giving e-mail back to the users: Using digital signatures to solve the spam problem", First Monday, 8(9), September 2003.

[32]

US Department of Energy Computer Incident Advisory, January 26 2000. http://ciac.llnl.gov/ciac/bulletins/k-020.shtml.

[33]

C. K. Wong, M. G. Gouda, S. S. Lam, "Secure group communications using key graphs", IEEE/ACM Transactions on Networking 8(1): 16--30, 2000.

Digital Library

[34]

P. Zimmerman, The Official PGP User's Guide, MIT Press, ISBN: 0-262-74017-6, May 1995.

Digital Library

Cited By

(2018)PRE+International Journal of Web and Grid Services10.1504/IJWGS.2018.08839414:1(44-69)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1504/IJWGS.2018.088394
Hu XTang CWong DZheng X(2018)Efficient pairing-free PRE schemes for multimedia data sharing in IoTMultimedia Tools and Applications10.1007/s11042-017-5387-177:14(18327-18354)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s11042-017-5387-1
He KWeng JDeng RLiu J(2016)On the security of two identity-based conditional proxy re-encryption schemesTheoretical Computer Science10.1016/j.tcs.2016.08.023652:C(18-27)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.08.023
Show More Cited By

Index Terms

SELS: a secure e-mail list service

Recommendations

Invalidation of Mailing List Address to Block Spam Mails
APSCC '08: Proceedings of the 2008 IEEE Asia-Pacific Services Computing Conference

Mailing lists are used for information exchange in specific groups. However, in the recent times, the number of spam mails received has increased, and considerable amount of time is wasted in filtering spam mails. Spam filtering techniques are widerly ...
RMX: The Architecture Of Rule-based Mailing System
IDEAS '15: Proceedings of the 19th International Database Engineering & Applications Symposium

Mailing lists are widespread tools to communicate and share information with each other. Especially, organizations maintain so many of them for collaborative works. Because of conventional mailing schemes, it requires constant administration from its ...
To Reply or To Reply All: Understanding Replying Behavior in Group Email Communication
CSCW '16: Proceedings of the 19th ACM Conference on Computer-Supported Cooperative Work & Social Computing

“Reply” and “Reply All” buttons in email provide the convenience of a quick reply to those included in the email. Yet this very convenience can be troublesome to both the individual and the group involved if receivers intentionally or unintentionally ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '05: Proceedings of the 2005 ACM symposium on Applied computing

March 2005

1814 pages

ISBN:1581139640

DOI:10.1145/1066677

Conference Chair:
Hisham M. Haddad
Kennesaw State University
,
Editor:
Lorie M. Liebrock
New Mexico Institute of Mining and Technology, Socorro, NM
,
Program Chairs:
Andrea Omicini
Alma Mater Studiorum, Universita di Bologna, Italy
,
Roger L. Wainwright
Univerity of Tulsa, OK

Copyright © 2005 ACM.

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

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 March 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC05

Sponsor:

SIGAPP

SAC05: The 2005 ACM Symposium on Applied Computing

March 13 - 17, 2005

New Mexico, Santa Fe

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
514
Total Downloads

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

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

(2018)PRE+International Journal of Web and Grid Services10.1504/IJWGS.2018.08839414:1(44-69)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1504/IJWGS.2018.088394
Hu XTang CWong DZheng X(2018)Efficient pairing-free PRE schemes for multimedia data sharing in IoTMultimedia Tools and Applications10.1007/s11042-017-5387-177:14(18327-18354)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s11042-017-5387-1
He KWeng JDeng RLiu J(2016)On the security of two identity-based conditional proxy re-encryption schemesTheoretical Computer Science10.1016/j.tcs.2016.08.023652:C(18-27)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.08.023
Lin H(2015)Secure Content Distribution Using Multi-hop Proxy Re-encryptionWireless Personal Communications: An International Journal10.1007/s11277-015-2292-782:3(1449-1459)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1007/s11277-015-2292-7
Zhang JZhang Z(2015)Secure and efficient data-sharing in cloudsConcurrency and Computation: Practice & Experience10.1002/cpe.339527:8(2125-2143)Online publication date: 10-Jun-2015
https://dl.acm.org/doi/10.1002/cpe.3395
Emura KMiyaji AOmote K(2011)An Identity-Based Proxy Re-Encryption Scheme with Source Hiding Property, and its Application to a Mailing-List SystemPublic Key Infrastructures, Services and Applications10.1007/978-3-642-22633-5_6(77-92)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22633-5_6
Vivek SSharmila Deva Selvi SRadhakishan VPandu Rangan C(2011)Conditional Proxy Re-Encryption - A More Efficient ConstructionAdvances in Network Security and Applications10.1007/978-3-642-22540-6_49(502-512)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22540-6_49
Shao JCao ZLiu P(2011)SCCR: a generic approach to simultaneously achieve CCA security and collusion‐resistance in proxy re‐encryptionSecurity and Communication Networks10.1002/sec.1094:2(122-135)Online publication date: 28-Jan-2011
https://doi.org/10.1002/sec.109
Emura KMiyaji AOmote K(2010)An identity-based proxy re-encryption scheme with source hiding property, and its application to a mailing-list systemProceedings of the 7th European conference on Public key infrastructures, services and applications10.5555/2035155.2035164(77-92)Online publication date: 23-Sep-2010
https://dl.acm.org/doi/10.5555/2035155.2035164
Emura KMiyaji AOmote K(2010)A timed-release proxy re-encryption scheme and its application to fairly-opened multicast communicationProceedings of the 4th international conference on Provable security10.5555/1927915.1927937(200-213)Online publication date: 13-Oct-2010
https://dl.acm.org/doi/10.5555/1927915.1927937
Show More Cited By

View Options

Get Access

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.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents