Visible to the public Cryptography and Security

SoS Newsletter- Advanced Book Block

Cryptography and Security

Cryptography is the core practice and study of techniques for secure communication in the presence of third parties called adversaries. Cryptography intersects the disciplines of mathematics, computer science, and electrical engineering. The two dozen articles cited in this list were presented and published in 2013 and cover a range of specific topics such as single key encryption, blind keys, density estimation, and other items of specific interest.

  • "Clustering Large Probabilistic Graphs". G. Kollios, M. Potamias, and E. Terzi. IEEE TKDE, Vol. 25, No. 2, February 2013. This research should be of interest for those wanting to discover groups of users in affiliation networks. The authors demonstrated their method using a large social network of Yahoo! users consisting of one billion edges. (ID#:14-1023) Available at:
  • "Anonymous Credentials Light." Foteini Baldimtsi, Anna Lysyanskaya. ACM CCS 2013. This research should be of interest for those interested in constructing efficient and provably secure blind signatures with attributes. Suggests a method that can work in the elliptic group setting without bilinear pairings and is based on the DDH assumption. (ID#:14-1024) Available at:
  • "Spiral in Scala: Towards the Systematic Construction of Generators for Performance Libraries", Georg Ofenbeck, Tiark Rompf, Alen Stojanov, Martin Odersky and Markus Puschel Proc. International Conference on Generative Programming: Concepts & Experiences (GPCE), 2013 This research covers program generators and offers a systematic method for creating effective generators. (ID#:14-1025) Available at:
  • "A polynomial time approximation scheme for fault-tolerant distributed storage", C. Daskalakis, A. De, I. Diakonikolas, A. Moitra, and R. Servedio. ACM-SIAM Symposium on Discrete Algorithms (SODA), October 2013 conference presentation. Of interest mainly due to the subject matter. (ID#:14-1027) PDF available at:
  • "Testing equivalence between distributions using conditional samples." C. Canonne, D. Ron, and R. Servedio, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2014, to appear. In this paper, the authors focus on algorithms for two fundamental distribution testing problems: testing whether D = D- for an explicitly provided D-, and testing whether two unknown distributions D1 and D2 are equivalent. (ID#:14-1028) Available at:
  • "Learning Sums of Independent Integer Random Variables.", Daskalakis, I. Diakonikolas, R. O'Donnell, R. Servedio, and L.-Y. Tan. 54th Annual Symposium on Foundations of Computer Science (FOCS), 2013. This work studies the problem of learning an unknown random variable given access to independent samples drawn from it, essentially the problem of density estimation. (ID#:14-1029) Available at:
  • "A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry." De and I. Diakonikolas and R. Servedio. 39th International Conference on Automata, Languages and Programming (ICALP), 2013. This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis of Boolean functions and high-dimensional geometry. (ID#:14-1030) Available at:
  • "Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency "Kwangsu Lee, Seung Geol Choi, Dong Hoon Lee, Jong Hwan Park, and Moti Yung. Asiacrypt 2013. Of interest mainly due to subject matter. (ID#:14-1032) Available at:
  • "Amplification of Chosen-Ciphertext Security." Lin, H., and Tessaro, S. Advances in Cryptology -- EUROCRYPT 2013. May 2013. This research should be of interest to those looking at public key encryption scheme and security against chosen-ciphertext attacks. (ID#:14-1033) Available at:
  • "Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond." Goldwasser, S., Kalai, Y., Popa, R., Vaikuntanathan, V., and Zeldovich, N. The authors construct a succinct single-key functional encryption scheme for general functions that can be used to address the long-standing open problem in cryptography of reusing garbled circuits. (ID#:14-1034) IACR Cryptology ePrint Archive 2012: 733, Updated March 24, 2013.
  • "On the Lattice Isomorphism Problem". Ishay Haviv and Oded Regev. To be presented 2014 SODA. 2 Nov 2013. Of interest to those in the area SVP and related lattice problems are for polynomial approximation factors, and its relationship to lattice-based cryptography. (ID#:14-1035) Available at:
  • "A Note on Discrete Gaussian Combinations of Lattice Vectors". Divesh Aggarwal, Oded Regev. Submitted for publication and revised 10 Jan 2014. (ID#:14-1036) Available at:
  • "The Power of Linear Reconstruction Attacks." S. P. Kasiviswanathan, M. Rudelson, A. Smith. 24th Annual ACM Symposium on Discrete Algorithms (SODA), January 2013. Considers the power of "linear reconstruction attacks" in statistical data privacy, showing that they can be applied to a much wider range of settings than previously understood. (ID#:14-1037) Available at:
  • "Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries" David Cash, Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel Rosu, Michael Steiner. CRYPTO 2013 Of interest due to subject matter. (ID#:14-1039) Available at:
  • "Dynamic Proofs of Retrievability via Oblivious RAM." David Cash, Alptekin Kupcu, Daniel Wichs. EUROCRYPT 2013 The authors offer a solution providing proofs of retrievability for dynamic storage, where the client can perform arbitrary reads/writes on any location within her data by running an efficient protocol with the server. Keywords: cryptographic protocols / Proofs of Retrievability, PoR, Oblivious RAM, ORAM . (ID#:14-1040) Available at:
  • "Fundamentals of Arabic cryptology and covert communication networks". Adam Miles. Unpublished Masters thesis (Applied mathematics). Of interest due to subject matter. Analysis of covert communications methods from open sources. (ID#:14-1041) Available at:
  • "Attribute-Based Encryption for Arithmetic Circuits". D. Boneh, V. Nikolaenko, and G. Segev. Cryptology ePrint Archive: Report 2013/669. Presents an Attribute Based Encryption system where access policies are expressed as polynomial size arithmetic circuits. (ID#:14-1042) Available at:
  • "Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation". D. Boneh and M. Zhandry. Cryptology ePrint Archive: Report 2013/642. The authors show how to use indistinguishability obfuscation (iO) to build multiparty key exchange, efficient broadcast encryption, and efficient traitor tracing. (ID#:14-1043) Available at:
  • "Constrained Pseudorandom Functions and Their Applications". D. Boneh and B. Waters. Proceedings of Asiacrypt 2013, LNCS 8270, pp. 280-300. Authors offer a new construct of pseudorandom functions (PRFs) they call constrained PRFs. (ID#:14-1044) Available at:
  • "Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding", Zvika Brakerski and Guy Rothblum. TCC 2014. Presents a new general-purpose obfuscator for all polynomial-size circuits. (ID#:14-1045) Available at:
  • "A Secure Submission System for Online Whistleblowing Platforms", Volker Roth, Benjamin Gueldenring, Eleanor Rieffel, Sven Dietrich and Lars Ries Proceedings of Financial Cryptography and Data Security 2013, 8 pp, Springer LNCS 7859, April 2013. The authors suggest a submission system for online whistleblowing platforms that they call AdLeaks. Their objective of is to make whistleblower submissions unobservable even if the adversary sees the entire network traffic. (ID#:14-1046) Available at:
  • "Set-Difference Range Queries". David Eppstein, Michael T. Goodrich, Joseph A. Simons. June, 2013. n.p. Introduces the problem of performing set-difference range queries, where answers to queries are set-theoretic symmetric differences between sets of items in two geometric ranges. Keywords: Data Structures and Algorithms. (ID#:14-1047) Available at:
  • "Message-Locked Encryption and Secure Deduplication". M. Bellare, S. Keelveedhi and T. Ristenpart. Advances in Cryptology - Eurocrypt 2013 Proceedings, Lecture Notes in Computer Science Vol. XXXX, T. Johansson and P. Nguyen eds, Springer, 2013 Formalizes a new cryptographic primitive, Message-Locked Encryption (MLE), where the key under which encryption and decryption are performed is itself derived from the message. (ID#:14-1048) Available at:
  • "Adaptive and Concurrent Secure Computation from New Adaptive, Non-Malleable Commitments." D. Dachman-Soled, T. Malkin, M. Raykova and M. Venkitasubramaniam . Asiacrypt 2013. Provides conceptual simplicity and insight into what is required for adaptive and concurrent security, as well as yielding improvements to set-up assumptions and/or computational assumptions. (ID#:14-1049) Available at:
  • "Anon-Pass: Practical Anonymous Subscriptions," Jonathan Katz, Michael Lee, Alan Dunn, Brent Waters, and Emmett Witchel. IEEE Security & Privacy, to appear. (Invited to a special issue for selected papers from the 2013 IEEE Symposium on Security & Privacy.) Presents the design, security proof, and implementation of an anonymous subscription service. (ID#:14-1050) Available at: Source code link also available at:
  • "ZMap: Fast Internet-wide Scanning and its Security Applications." Zakir Durumeric, Eric Wustrow, and J. Alex Halderman. Proc. 22nd USENIX Security Symposium Sec '13, Washington, D.C., August 2013. The authors introduce ZMap, a modular, open-source network scanner specifically architected to perform Internet-wide scans and capable of surveying the entire IPv4 address space in under 45 minutes from user space on a single machine, approaching the theoretical maximum speed of gigabit Ethernet. (ID#:14-1051) Available at:
  • "Analysis of Reusability of Secure Sketches and Fuzzy Extractors", M. Blanton and M. Aliasgari, IEEE Transactions on Information Forensics and Security (TIFS), Vol. 8, No. 9, pp. 1433-1445, Sep. 2013. According to the authors, secure sketches and fuzzy extractors enable the use of biometric data in cryptographic applications by correcting errors in noisy biometric readings and producing cryptographic materials suitable for authentication, encryption, and other purposes. (ID#:14-1052) Available at:
  • " Explicating SDKs: Uncovering Assumptions Underlying Secure Authentication and Authorization." Rui Wang, Yuchen Zhou, Shuo Chen, Shaz Qadeer, David Evans, and Yuri Gurevich. 22nd USENIX Security Symposium, Washington DC, 14-16 August 2013. Major online providers, such as Facebook and Microsoft, provide SDKs for incorporating authentication services. This paper considers whether those SDKs enable typical developers to build secure apps. (ID#:14-1053) Available at:
  • "Dynamic task allocation in asynchronous shared memory". Dan Alistarh, James Aspnes , Michael Bender, Rati Gelashvili, and Seth Gilbert . To appear, SODA 2014. Task allocation is a classic distributed problem in which a set of potentially faulty processes must cooperate to perform a set of tasks. This paper considers a new dynamic version of the problem, in which tasks are injected adversarially during an asynchronous execution. (ID#:14-1054) Available at:
  • "Secure Configuration of Intrusion Detection Sensors for Dynamic Enterprise-Class Distributed Systems", Gaspar Modelo-Howard, PhD thesis, Purdue 2013. In order to secure current computer systems it is necessary to have sensors included to monitor their performance against security goals. This paper discusses how to evaluate by using a Bayesian model various configurations of detectors to achieve these goals. Results of a successful attack are compared to the detector alerts. (ID#:14-1055) See:
  • "Social Influences on Secure Development Tool Adoption: Why Security Tools Spread", Shundan Xiao, Jim Witschey, Emerson Murphy-Hill. Proceedings of Computer Supported Cooperative Work, 2014. This article should be of interest to those interested in human factors. The research studies the social factors related to why individuals fail to use tools available to them to ensure software quality and security. (ID#:14-1056) See
  • "Trust mechanisms for cloud computing". Jingwei Huang and David M. Nicol. Journal of Cloud Computing, 2(1), April 2013 This article should be of interest to those concerned about establishing trust in cloud computing. The authors critically analyze "trust" and its basis for cloud computing users. Their analysis ranges from perceptual to semantic to engineering methods for formal accreditation, auditing and standards, and specific tools and their utility and limitations. (ID#:14-1057) See
  • "PHANTOM: Practical Oblivious Computation in a Secure Processor", Martin Maas, Eric Love, Emil Stefanov, Mohit Tiwari, Elaine Shi, Krste Asanovic, John Kubiatowicz, Dawn Song. Proceedings of the 20th ACM Conference on Computer and Communications Security (CCS), November 2013. This study introduces PHANTOM, a new secure processor that obfuscates its memory access trace. The authors achieve obliviousness through a cryptographic construct known as Oblivious RAM or ORAM. (ID#:14-1058) Available at:


Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to SoS.Project (at) for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.