Sharif Digital Repository

We construct an efficient statistical zero-knowledge authentication protocol for smart cards based on general assumptions. We show how it can be instantiated using lattice-based primitives, which are conjectured to be secure against quantum attacks. We illustrate the practicality of our protocol on smart cards in terms of storage, computation, communication, and round complexities. Furthermore, we compare it to other lattice-based authentication protocols, which are either zero-knowledge or have a similar structure. The comparison shows that our protocol improves the best previous protocol in several aspects  

We apply Hamilton's principle and model the coupled in-plane and transverse vibrations of high-speed spinning disks, which are fiber-reinforced circumferentially. We search for eigenmodes in the linear regime using a collocation scheme, and compare the mode shapes of composite and isotropic disks. As the azimuthal wavenumber varies, the radial nodes of in-plane waves are remarkably displaced in isotropic disks while they resist such displacements in composite disks. The reverse of this phenomenon happens for transversal waves and the radial nodes move toward the outer disk edge as the azimuthal wavenumber is increased in composite disks. This result is in accordance with the predictions of... 

This paper suggests a model and a definition for forward-secure authenticated key exchange (AKE) protocols, which can be satisfied without depending on the Diffie–Hellman assumption. The basic idea is to use keyevolving schemes (KES), where the long-term keys of the system get updated regularly and irreversibly. Protocols conforming to our model can be highly efficient, since they do not require the resource-intensive modular exponentiations of the Diffie–Hellman protocol. We also introduce a protocol, called FORSAKES, and prove rigorously that it is a forward-secure AKE protocol in our model. FORSAKES is a very efficient protocol, and can be implemented by merely using hash functions  

Chevallier-Mames et al, proved that in a specific condition (such as the lack of untappable channels and trusted-third parties), the universal verifiability and privacy-preserving properties of e-voting protocols are incompatible (WOTE'06 and TTE'10). In this paper, we first show a flaw in their proof. Then, we prove that even with more assumptions, such as the existence of TTPs and untappable channels between the authorities, an e-voting protocol is unable to preserve privacy, regardless of verifiability. Finally, we demonstrate that preserving privacy in e-voting protocols requires the provision of at least one of the following assumptions: limited computational power of adversary,... 

Learning a foreign language encompasses a process of trial and error that can lead to the progression of the learner's interlanguage, meaning that the learners make use of their language knowledge that receives feedback and brings about progress through diagnosis of the problems and being corrected by the teacher. Therefore, there exists a need to analyze the underlying reasons causing the students to remain taciturn with a low willingness to communicate (WTC) during a language class. There has been much work done investigating the role of the learner's stable personal characteristics (traits) along with their situational changes at a specific time (states) that influence the student's... 

Using 3-D scanned data to analyze and extract pore network plays a vital role in investigation of porous media's characteristics. In this paper, a new simple method is developed to detect pores and throats for analyzing the connectivity and permeability of the network. This automated method utilizes some of the common and well-known image processing functions which are widely accessible by researchers and this has led to an easy algorithm implementation. In this method, after polishing and quality control of images, using city-block distance function and watershed segmentation algorithm, pores and throats are detected and 3-D network is produced. This method can also be applied on 2-D images... 

In this paper, we try to recognize and distinguish different groups of arrhythmia using novel features which have been obtained from the heart rate's phase space in recent years. For this purpose, we used Triangular Phase Space Mapping (TPSM) and Parabolic Phase Space Mapping (PPSM). For recognition, we used three groups of 15 subjects using the Physionet database (Arrhythmia, Congestive Heart Failure (CHF), and Atrial Fibrillation (AF)) with Normal Sinus Rhythm (NSR). The obtained features discriminate arrhythmia from NSR by p