Monash Cyber Security Reading Group
Welcome to the Monash Cyber Security Reading Group (MCSRG) web page. We are a research group of
academics and students, based at the Faculty of Information Technology, Monash University.
We share a common interest in all aspects of cyber security and meet to read and discuss recent papers on topics of interest to the group.
More information on the group's activities is available below. Group meetings times and discussion topics are advertised below. Meetings are held at Room 115, Building 63, Clayton Campus, Monash University,
unless otherwise advised.
Visitors are welcome. For more information, please contact Ron Steinfeld (firstname.lastname@example.org).
- January 2017: This year, we will have regular bi-weekly reading group seminars.
Usually, each seminar will be presented by a different Monash `Regular Presenting Group Member' (those members are listed below), going by alphabetic order of first name (except for the first seminar, which will be given by Ron S.).
Details of upcoming seminars will be posted about a week before each seminar on this website.
Regular Presenting Group Members (in alphabetic order of first name):
- Tuesday, 21 February 2017, 11:00am-12:00pm, Room 115, 25 Exhibition Walk, Clayton Campus.
Presenter: Huaxiong Wang (Nanyang Technological University, Singapore)
Talk Title: On Efficient Communication of Secret Reconstruction in Secret Sharing Schemes
Abstract: A secret sharing scheme typically requires secure communications in each of two distribution phases: (1)
a dealer distributes shares to participants (share distribution phase); and later (2) the participants in some authorised subset
send their share information to a combiner (secret reconstruction phase). While problems on storage required for participants,
for example, the size of shares, have been well studied, problems regarding the communication complexity of the two distribution
phases seem to have been mostly neglected in the literature. In this talk, we deal with several communication related problems
in the secret reconstruction phase, and show that there is a tradeoff between the communication costs and the number of participants
involved in the secret reconstruction. We also give an overview on some recent development in the topic. The talk is based (in part)
on the following paper:
- Huaxiong Wang and Duncan S. Wong, "On Secret Reconstruction in Secret Sharing Schemes", IEEE Transactions on Information Theory,
Vol. 54, No. 1, pp. 473-480, 2008.
- Tuesday, 14 February 2017, 11:00am-1:00pm, Room 115, 25 Exhibition Walk, Clayton Campus.
Presenter: Amin Sakzad (Monash U.)
Talk Title: Function Secret Sharing (FSS) and Splinter
Abstract: The new cryptographic tool, function secret sharing (FSS), will be introduced based on the following paper:
One of its applications, the `Splinter' protocol for practical private queries, will be discussed too:
- Elette Boyle, Niv Gilboa, and Yuval Ishai, "Function Secret Sharing", In Proceedings of EUROCRYPT 2015. Available at the following link.
- Frank Wang, Catherine Yun, Shafi Goldwasser, Vinod Vaikuntanathan, and Matei Zaharia, "Splinter: Practical Private Queries on Public Data", In Proceedings of 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI'17). Available at the following link.
- Tuesday, 31 January 2017, 11:00am-1:00pm, Room 115, 25 Exhibition Walk, Clayton Campus.
Presenter: Ron Steinfeld (Monash U.)
Abstract: We'll discuss the `Blind Seer' protocol for search on encrypted databases:
- Vasilis Pappas, Fernando Krell, Binh Vo, Vladimir Kolesnikov, Tal Malkin, Seung Geol Choi, Wesley George, Angelos D. Keromytis, and Steven M. Bellovin, "Blind Seer: A Scalable Private DBMS" In Proceedings of the 35th IEEE Symposium on Security & Privacy (S&P), May 2014, San Jose, CA. Available at the following link.
- Friday, 12 September 2014, 2:00pm-3:30pm, Room G12A, Building 26. At this meeting, we'll discuss a recent paper on privacy-preserving cloud-based search:
- B. Yao, F. Li, X. Xiao. Secure Nearest Neighbor Revisited. Available here.
- Thursday, 24 July 2014, 4:30pm-5:30pm, Room 115, Building 63. At this meeting, we'll look at a nice application of
cryptographic multilinear maps (discussed last time) to construct efficient broadcast encryption schemes.
The constructions are described in the following paper (to be presented at Crypto 2014):
- D. Boneh, B. Waters and M. Zhandry. Low Overhead Broadcast Encryption from Multilinear Maps. Available here.
- Friday, 27 June 2014, 1:30pm-3:00pm, Room 12A, Building 26 (note unusual venue). At this meeting, we'll look at the GGH construction of cryptographic multilinear maps from ideal lattices, and some of their applications.
The GGH construction is described in the following paper (presented at Eurocrypt 2013):
- S. Garg, C. Gentry, S. Halevi. Candidate Multilinear Maps from Ideal Lattices. Available here.
- Friday, 8 Nov. 2013, 2pm-3:30pm. At this meeting (and subsequent ones), I propose we continue along the theme we began in
the previous meeting, namely looking at cryptosystems with extra functionality and their applications. For the coming meeting, we'll discuss the
following paper presented at STOC 2013. The paper gives a new technique (based on the LWE problem we discussed last time) for
building "Attribute-Based Encryption" (ABE), a powerful generalization of "Identity-Based Encryption" (IBE) that allows an encryptor
to specify a set of parameters for controlling access to decryption of ciphertexts.
- S. Gorbunov, V. Vaikuntanathan, H. Wee. Attribute-Based Encryption for Circuits. Available here.
- Friday, 27 Sep. 2013, 2pm-3:30pm. At this meeting, we'll discuss the following paper presented at the Crypto 2013 conference, which reports on progress in the design of Fully Homomorphic Encryption (FHE) schemes based on lattice problems.
- C. Gentry, A. Sahai, B. Waters. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically Faster, Attribute-Based. Available here.
Shabnam Kasra Kermanshahi
Wilson Alberto Torres