scholarly journals NetVote: A Strict-Coercion Resistance Re-Voting Based Internet Voting Scheme with Linear Filtering

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1618
Author(s):  
Iñigo Querejeta-Azurmendi ◽  
David Arroyo Guardeño ◽  
Jorge L. Hernández-Ardieta ◽  
Luis Hernández Encinas
Keyword(s):  
Linear Complexity ◽  
Security Analysis ◽  
Linear Filtering ◽  
Vote Buying ◽  
Internet Voting ◽  
Formal Definitions ◽  
Cryptographic Keys ◽  
Vote Intention ◽  
Definition Of ◽  
Everlasting Privacy

This paper proposes NetVote, an internet voting protocol where usability and ease in deployment are a priority. We introduce the notion of strict coercion resistance, to distinguish between vote-buying and coercion resistance. We propose a protocol with ballot secrecy, practical everlasting privacy, verifiability and strict coercion resistance in the re-voting setting. Coercion is mitigated via a random dummy vote padding strategy to hide voting patterns and make re-voting deniable. This allows us to build a filtering phase with linear complexity, based on zero knowledge proofs to ensure correctness while maintaining privacy of the process. Voting tokens are formed by anonymous credentials and pseudorandom identifiers, achieving practical everlasting privacy, where even if dealing with a future computationally unbounded adversary, vote intention is still hidden. It is not assumed for voters to own cryptographic keys prior to the election, nor store cryptographic material during the election. This property allows voters not only to vote multiple times, but also from different devices each time, granting the voter a vote-from-anywhere experience. This paper builds on top of the paper published in CISIS’19. In this version, we modify the filtering. Moreover, we formally define the padding technique, which allows us to perform the linear filtering scheme. Similarly we provide more details on the protocol itself and include a section of the security analysis, where we include the formal definitions of strict coercion resistance and a game based definition of practical everlasting privacy. Finally, we prove that NetVote satisfies them all.

scholarly journals On Privacy Notions in Anonymous Communication

2019 ◽  
Vol 2019 (2) ◽  
pp. 105-125 ◽  
Author(s):  
Christiane Kuhn ◽  
Martin Beck ◽  
Stefan Schiffner ◽  
Eduard Jorswieck ◽  
Thorsten Strufe
Keyword(s):  
Communication Networks ◽  
Ad Hoc ◽  
Building Blocks ◽  
Anonymous Communication ◽  
Formal Definition ◽  
Formal Definitions ◽  
Definition Of

Abstract Many anonymous communication networks (ACNs) with different privacy goals have been developed. Still, there are no accepted formal definitions of privacy goals, and ACNs often define their goals ad hoc. However, the formal definition of privacy goals benefits the understanding and comparison of different flavors of privacy and, as a result, the improvement of ACNs. In this paper, we work towards defining and comparing privacy goals by formalizing them as privacy notions and identifying their building blocks. For any pair of notions we prove whether one is strictly stronger, and, if so, which. Hence, we are able to present a complete hierarchy. Using this rigorous comparison between notions, we revise inconsistencies between the existing works and improve the understanding of privacy goals.

scholarly journals Simple and Effective Secure Group Communications in Dynamic Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1909 ◽  
Author(s):  
Hisham N. AlMajed ◽  
Ahmad S. AlMogren
Keyword(s):  
Network Performance ◽  
Security Analysis ◽  
Wireless Sensor ◽  
Group Key ◽  
Security Research ◽  
Group Members ◽  
Shared Key ◽  
Definition Of ◽  
First Time ◽  
Secure Group Communications

Wireless Sensor Network (WSN) is a growing area of research in terms of applications, life enhancement and security. Research interests vary from enhancing network performance and decreasing overhead computation to solving security flaws. Secure Group Communication (SGC) is gaining traction in the world of network security. Proposed solutions in this area focus on generating, sharing and distributing a group key among all group members in a timely manner to secure their communication and reduce the computation overhead. This method of security is called SGC-Shared Key. In this paper, we introduce a simple and effective way to secure the network through Hashed IDs (SGC-HIDs). In our proposed method, we distribute a shared key among the group of nodes in the network. Each node would have the ability to compute the group key each time it needs to. We provide a security analysis for our method as well as a performance evaluation. Moreover, to the best of our knowledge, we present for the first time a definition of joining or leaving attack. Furthermore, we describe several types of such an attack as well as the potential security impacts that occur when a network is being attacked.

scholarly journals A largely self-contained and complete security proof for quantum key distribution

Quantum ◽  
2017 ◽  
Vol 1 ◽  
pp. 14 ◽  
Author(s):  
Marco Tomamichel ◽  
Anthony Leverrier
Keyword(s):  
Quantum Key Distribution ◽  
Estimation Error ◽  
Security Analysis ◽  
Key Distribution ◽  
Operational Definition ◽  
Uncertainty Relations ◽  
Secret Key ◽  
Security Proof ◽  
Key Length ◽  
Definition Of

In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and prepare-and-measure protocols. The goal of this paper is twofold: 1) to review and clarify the stateof-the-art security analysis based on entropic uncertainty relations, and 2) to provide an accessible resource for researchers interested in a security analysis of quantum cryptographic protocols that takes into account finite resource effects. For this purpose we collect and clarify several arguments spread in the literature on the subject with the goal of making this treatment largely self-contained. More precisely, we focus on a class of prepare-and-measure protocols based on the Bennett-Brassard (BB84) protocol as well as a class of entanglement-based protocols similar to the Bennett-Brassard-Mermin (BBM92) protocol. We carefully formalize the different steps in these protocols, including randomization, measurement, parameter estimation, error correction and privacy amplification, allowing us to be mathematically precise throughout the security analysis. We start from an operational definition of what it means for a quantum key distribution protocol to be secure and derive simple conditions that serve as sufficient condition for secrecy and correctness. We then derive and eventually discuss tradeoff relations between the block length of the classical computation, the noise tolerance, the secret key length and the security parameters for our protocols. Our results significantly improve upon previously reported tradeoffs.

Human Security

2017 ◽  
Author(s):  
Edward Newman
Keyword(s):  
Security Policy ◽  
Security Analysis ◽  
Human Security ◽  
Security Studies ◽  
Ethical Orientation ◽  
Critical Security Studies ◽  
Starting Point ◽  
Negative Rights ◽  
Definition Of ◽  
The Individual

Human security suggests that security policy and security analysis, if they are to be effective and legitimate, must focus on the individual as the referent and primary beneficiary. In broad terms, human security is “freedom from want” and “freedom from fear:” positive and negative rights as they relate to threats to core individual needs. Human security is normative; it argues that there is an ethical responsibility to (re)orient security around the individual in line with internationally recognized standards of human rights and governance. Much human security scholarship is therefore explicitly or implicitly underpinned by a solidarist commitment to moral obligation, and some are cosmopolitan in ethical orientation. However, there is no uncontested definition of, or approach to, human security, though theorists generally start with human security challenges to orthodox neorealist conceptions of international security. Nontraditional and critical security studies (which are distinct from human security scholarship) also challenges the neorealist orthodoxy as a starting point, although generally from a more sophisticated theoretical standpoint than found in the human security literature. Critical security studies can be conceived broadly to embrace a number of different nontraditional approaches which challenge conventional (military, state-centric) approaches to security studies and security policy. Human security has generally not been treated seriously within these academic security studies debates, and it has not contributed much either.

Granularity Issues in the Alignment of Upper Ontologies

2009 ◽  
Vol 48 (02) ◽  
pp. 184-189 ◽  
Author(s):  
M. Boeker ◽  
H. Stenzhorn ◽  
J. Niggemann ◽  
S. Schulz
Keyword(s):  
Description Logics ◽  
Formal Ontology ◽  
Free Text ◽  
Basic Formal Ontology ◽  
Domain Experts ◽  
Use Of Data ◽  
Formal Definitions ◽  
Domain Ontologies ◽  
Definition Of ◽  
Upper Ontology

Summary Objectives: The application of upper ontologies has been repeatedly advocated for to support the interoperability between different domain ontologies for facilitating the shared use of data within and across disciplines. BioTop is an upper domain ontology that aims at aligning more specialized biomolecular and biomedical ontologies. The integration of BioTop and the upper ontology Basic Formal Ontology (BFO) is the objective of this study. Methods: BFO was manually integrated into BioTop, observing both its free text and formal definitions. BioTop classes were attached to BFO classes as children and BFO classes were reused in the formal definitions of BioTop classes. A description logics reasoner was used to check the logical consistency of this integration. The domain adequacy was checked manually by domain experts. Results: Logical inconsistencies were found by the reasoner when applying the BFO classes for fiat and aggregated objects in some of the BioTop class definitions. We discovered that the definition of those particular classes in BFO was dependent on the notion of physical connectedness. Hence we suggest ignoring a BFO subbranch in order not to hinder cross-granularity integration. Conclusion: Without introducing a more sophisticated theory of granularity, the described problems cannot be properly dealt with. Whereas we argue that an upper ontology should be granularity-independent, we illustrate how granularity-dependent domain ontologies can still be embedded into the framework of BioTop in combination with BFO.

An Indirect Fingerprint Authentication Scheme in Cloud Computing

2014 ◽  
Vol 484-485 ◽  
pp. 986-990 ◽  
Author(s):  
Xing Chen Jiang ◽  
Jian De Zheng
Keyword(s):  
Cloud Computing ◽  
User Authentication ◽  
Security Analysis ◽  
Critical Issue ◽  
Authentication Scheme ◽  
Security Threat ◽  
Biometric Template ◽  
Security Challenges ◽  
Cryptographic Keys ◽  
Biometric Cryptosystem

The cloud computing offers dynamically scalable online resources provisioned as a service over the Internet cheaply. However, the security challenges it poses are equally striking. The reliable user authentication techniques are required to combat the rising security threat in cloud communications. Due to the non-denial requirements of remote user authentication scheme, it is most commonly achieved using some form of biometrics-based method. Fingerprint authentication is one of the popular and effective approaches to allow the only authorized users to access the cryptographic keys. While the critical issue in remote biometric cryptosystem is to protect the template of a user stored in a database. The biometric template is not secure and the stolen templates cannot be revoked, which is easy to leak user identity information. To overcome these shortcomings, in this paper, an indirect fingerprint authentication scheme is proposed. Further, we apply this secure scheme to the cloud system combing with PKI mechanism. At last, a comprehensive and detailed security analysis of the proposed scheme in cloud computing is provided.

scholarly journals Formalized Hierarchically Nested Expert System for Classification of Mesic and Wet Grasslands in Poland

2021 ◽  
Vol 89 (4) ◽  
Author(s):  
Zygmunt Kącki ◽  
Grzegorz Swacha ◽  
Attila Lengyel ◽  
Joanna Korzeniak
Keyword(s):  
Expert System ◽  
Classification System ◽  
Hierarchical Level ◽  
Formal Definitions ◽  
Wet Grasslands ◽  
Species Groups ◽  
Definition Of ◽  
The Given ◽  
Vegetation Patches

The goal of this study was to propose a hierarchically nested classification system comprising four principal levels of the Braun-Blanquet system for Polish grasslands of the class <em>Molinio-Arrhenatheretea</em>. Using the Cocktail method, we defined consistent criteria for delimitation of the class, three orders, nine alliances, and 45 associations. Formal definitions were prepared using the summed cover and presence/absence information of species groups and individual dominant species. We created an expert system with a set of assignment rules that unambiguously classify relevés to a single unit at the given abstraction level of the Braun-Blanquet system in such a way that a relevé matched by the definition of a focal vegetation unit must be matched by definitions of all superior units. Of 11,535 relevés classified to <em>Molinio-Arrhenatheretea</em>, 36% were recognized at the association level, and 57% and 85% at the alliance and order level, respectively. All relevés were assigned unambiguously, meaning that a single relevé could not be assigned to more than one unit within the same hierarchical level (no overlap between vegetation units). This study is the first proposal of a hierarchically nested classification system that classifies grassland vegetation at different syntaxonomical levels unequivocally. It is important to create definitions for different syntaxonomical levels because the majority of vegetation patches do not fit to the associations, but can only be assigned to high-rank units such as alliance, order, or class.

scholarly journals Kosovar Refugees and National Security

Refuge ◽  
1999 ◽  
pp. 41-46 ◽  
Author(s):  
Yannis A. Stivachtis
Keyword(s):  
National Security ◽  
Security Analysis ◽  
Western World ◽  
Safe Place ◽  
International Stability ◽  
Methodological Problems ◽  
Fortress Europe ◽  
Definition Of ◽  
Balkan States ◽  
The Impact

Almost one million people have been forced to leave Kosovo in search of a safe place for settlement. Although it has not been explicitly stated, the main reason that the Balkan states, as well as those of the Western world, are reluctant to receive them as refugees is that they believe that this would jeopardize their security. Some justify this reluctance as another assertion of the "Fortress Europe" ideal. Approaching the subject from a comprehensive security perspective, this article aims to explain how and why the Kosovar refugees may threaten, or may be perceived to threaten, the national security of the receiving states as well as regional and international stability. In so doing, it discusses some methodological problems concerning the definition of security; it relates refugee migration to the various levels of security analysis; and it examines the impact of refugee activities with reference to the various security sectors.

Secure and Energy-Efficient Routing for Cluster-Based Wireless Sensor Networks

2018 ◽  
pp. 24-46
Author(s):  
Meenakshi Tripathi ◽  
M. S. Gaur ◽  
Vijay Laxmi ◽  
Ramesh Battula
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Security Analysis ◽  
Base Station ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Battery Life ◽  
Energy Efficient Routing ◽  
Hierarchical Topology ◽  
Cryptographic Keys

Security is a prime concern in the resource constrained wireless sensor networks. Traditional cryptographic mechanisms cannot be used with these networks due to their limited battery. Clustering is one of the popular methods to improve the energy efficiency of WSN. In this chapter, the authors propose a secure routing protocol for cluster-based wireless sensor networks. A hierarchical topology is formed by the base station, which is also responsible for distributing the cryptographic keys among the nodes. Security analysis of the proposed protocol is done against various security attacks. The efficiency of the proposed protocol is explained through mathematical calculations and simulations. The proposed protocol also performs better than other existing secure protocols for cluster-based WSN regarding battery life and security overhead.

Sign in / Sign up

Export Citation Format

Share Document