If you follow me on Twitter you have no doubt heard my occasional outbursts and rants on what I perceive to be biases in the current publication model in cryptography. In short, I think that top cryptography conferences are heavily biased against certain areas of cryptography and for others.
Some of the areas that I think have a much harder time getting into top-tier crypto conferences include Applied Cryptography. I don' t think this is particularly controversial and, from what I hear, CRYPTO has even tried to rectify this recently (e.g., by accepting some applied MPC papers).
Nevertheless, this is a serious problem for applied crypto research since applied crypto papers don' t really have a home. Realistically, your choice in venues include CCS, NDSS, Usenix, Oakland and Financial Crypto. Notice that all these conferences are security conferences and as such they only have a limited number of places for crypto research. And a consequence of this is that competition for these few places is very high.
Another consequence of the current situation is that applied crypto papers are dispersed in many different venues. In addition to the ones listed above you also find them in Esorics, AsiaCCS, ACNS etc. This makes it very hard to keep track of new results (having ePrint helps a bit here) and even harder to build any kind of community since no one is at the same place at the same time. This impacts possible collaborations, opportunities for students etc.
Another issue is that these papers don' t get the visibility they deserve and this is problematic because some of the work is very strong and, more importantly, this is the work that has the most potential for impact. Think about that for a second: the type of work that has the highest chance of having impact on society has a harder time being accepted at top-tier conferences. How can this not be a serious problem for the community?
A final consequence is that because these works do not receive the visibility they deserve, less people tend to work on applied problems. I may be cynical, but unfortunately I think many researchers choose their problems (at least in part) as a function of the recognition they might receive from their community for their work. I can' t always blame researchers for this since the academic system is setup to incentivize this (especially when you are student). With the current situation, therefore, I suspect that many researchers and students who might be interested in (or at least open to) applied work may shy away from it since the short-term rewards like top-tier crypto papers and visibility is less likely to materialize. An alternative way in which this could be affecting researchers is that the pull from other areas that do get more recognition (in the form of top-tier papers and visibility) is too hard to compete with for applied crypto.
Obviously, I would like this to be fixed somehow especially so that applied crypto can still attract good students. But my sense is that the larger crypto community doesn' t really care that much (modulo, perhaps, the alleged efforts made by CRYPTO recently).
In the meantime, I thought it might be good to highlight a few applied crypto papers written by up-and-coming researchers (i.e., mostly students, postdocs and junior researchers) that I find particularly interesting. So I asked a handful of young researchers if they would be interested in writing guest posts summarizing some of their work. I' ll be posting some of these summaries in a new series that will start soon. How long the series will be will obviously depend on how many people are interested in writing. Hopefully we will have at least two or three.
Let me stress that this series will obviously be subjective and biased towards topics that I like and people that I know (though I won' t be hesitant to invite people I don' t know if I like their work). This is unavoidable since these are papers that I' m inviting to be summarized on my blog. So please do not complain in the comments that your paper was not invited to be discussed.
With that out of the way, I hope you enjoy the series.
research paper-computer science-cryptography
logic-functions-for cryptography a-tutorial
elliptic curve cryptography-2013 research papers
A Survey of Low Power Elliptic Curve Cryptography for Smart Network
ABSTRACT The proposed project is to implement a novel idea in Sensor networks. Normally Sensor networks are used to sense environment and collect data. Security in such networks is a big challenge. The first challenges of security in sensor networks lie in the conflicting
PHYSIOLOGICAL VALUE BASED PRIVACY PRESERVATION OF PATIENT'S DATA USINGELLIPTIC CURVE CRYPTOGRAPHY
Abstract Body Sensor Network (BSN) is a suitable combination of wearable tiny devices attached to patient's body. Their purpose is to monitor patient's physiological data (or BSN data) values. Sensors continuously monitor and collect patient's data and send it to a
Efficient Encryption Scheme based on Elliptic Curve Cryptography (ECC) and Symmetric algorithm in Wireless Body Area Networks (WBANs)
ABSTRACT. In this paper, we present efficient encryption scheme based on Elliptic Curve Cryptography (ECC) to protect patient's medical data in healthcare system. The proposed scheme used the symmetric cipher algorithm (ie, DES, modified Feistel algorithm, etc.) to
Elliptic Curve Cryptography in Practice
Abstract. In this paper, we perform a review of elliptic curve cryptography (ECC), as it is used in practice today, in order to reveal unique mistakes and vulnerabilities that arise in implementations of ECC. We study four popular protocols that make use of this type of
DESIGN OF MOBILE PUBLIC KEY INFRASTRUCTURE (M-PKI) USING ELLIPTIC CURVE CRYPTOGRAPHY
ABSTRACT Recently the demand of mobile phones and their applications are increasing rapidly and as a result, it becomes essential to design and/or improve the existing PKI (Public Key Infrastructure) useful for mobile phones or devices. Since a mobile phone has
An Efficient Scalar Multiplication Algorithm for Elliptic Curve Cryptography Using a New Signed-Digit Representation
Abstract. This paper presents and evaluates a novel encoding algorithm to reduce the Hamming weight of the scalar. The scalar multiplication is modified to utilize this new scalar representation. The results show that the computation cost (the number of required clock
An Improved Remote User Authentication Scheme with Elliptic Curve Cryptography and Smart Card without using Bilinear Pairings
ABSTRACT Login to the remote server over unreliable insecure network demands secured password a secured password authentication with less computational cost. We have proposed a remote user authentication scheme based on ECC that establish strong
Fast Software Implementation of Binary Elliptic Curve Cryptography
ABSTRACT. This paper presents an efficient and side channel protected software implementation of point multiplication for the standard NIST and SECG binary elliptic curves. The enhanced performance is achieved by improving the Lopez-Dahab/Montgomery
Complete and Unified Group Laws are not Enough for Elliptic Curve Cryptography.
ABSTRACT We analyze four recently proposed normal forms for elliptic curves. Though these forms are mathematically appealing and exhibit some cryptographically desirable properties, they nonetheless fall short of cryptographic viability, especially when
Elliptic Curve Cryptography in Securing Networks by Mobile Authentication
Abstract This paper proposes an enhanced authentication model, which is suitable for low- power mobile devices. It uses an Extended Password Key Exchange Protocols and elliptic-curve-cryptosystem based trust delegation mechanism to generate a delegation
Prospective Utilization of Elliptic Curve Cryptography for Security Enhancement
Abstract Now a days Elliptic curve cryptography (ECC) is the most efficient public key encryption scheme based on elliptic curve concepts that can be used to create faster, smaller, and efficient cryptographic keys. ECC generates keys through the properties of
An Enhanced Opass With Modified Elliptic Curve Cryptography-Based User Authentication Scheme For Grid Computing
ABSTRACT User authentication to an open server or a system based on username and password is familiar to access the control. Entering the username and password in an untruthful computer is impulse to avert from involuntary exposure through phishing,
Binary Edwards Curves in Elliptic Curve Cryptography
Edwards curves are a new normal form for elliptic curves that exhibit some cryptographically desirable properties and advantages over the typical Weierstrass form. Because the group law on an Edwards curve (normal, twisted, or binary) is complete and unified,
Comprehensive Security System for Mobile Network Using Elliptic Curve Cryptography over GF (p)
ABSTRACT Mobile devices have many differences in their capabilities, computational powers and security requirements. Mobile devices can be used as the enabling technology for accessing Internet based services, as well as for personal communication needs in