6,098 Hits in 3.9 sec

Random but System-Wide Unique Unlinkable Parameters

Peter Schartner
2012 Journal of Information Security  
But, randomly chosen parameters come with the intrinsic chance of duplicates, which finally may cause cryptographic systems including RSA, ElGamal and Zero-Knowledge proofs to become insecure.  ...  When initializing cryptographic systems or running cryptographic protocols, the randomness of critical parameters, like keys or key components, is one of the most crucial aspects.  ...  Simply spoken, we will replace random parameters by system-wide unique but random parameters, generated by the use of applicationspecific CFNGs.  ... 
doi:10.4236/jis.2012.31001 fatcat:ktxlgzguxbfb3kp5snwn5o6u64

AnonPri: A secure anonymous private authentication protocol for RFID systems

Farzana Rahman, Md Endadul Hoque, Sheikh Iqbal Ahamed
2017 Information Sciences  
Majority of the privacy preserving protocols for RFID systems require the reader to search all tags in the system in order to identify a single RFID tag which not efficient for large scale systems.  ...  Privacy preservation in RFID systems is a very important issue in modern day world.  ...  System parameters.  ... 
doi:10.1016/j.ins.2016.07.038 fatcat:qarlw635lrhulecvcajgqon3ve

Efficient Tag Path Authentication Protocol with Less Tag Memory [chapter]

Hongbing Wang, Yingjiu Li, Zongyang Zhang, Yunlei Zhao
2016 Lecture Notes in Computer Science  
Meanwhile, a tag path authentication must meet a series of security requirements, such as authentication, privacy, and unlinkability. In addition, the authentication protocol must be efficient.  ...  Our protocol is compatible with EPC Class 1 Gen 2 tags and is provably secure under authentication, privacy, and (tag and path) unlinkability.  ...  The system with tracking capability has been widely adopted in supply chain management.  ... 
doi:10.1007/978-3-319-49151-6_18 fatcat:po6gwslfqfauxmdz2cyy6xhrry

Provably secure randomized blind signature scheme based on bilinear pairing

Chun-I Fan, Wei-Zhe Sun, Vincent Shi-Ming Huang
2010 Computers and Mathematics with Applications  
Various generic ideas and variants on blind signatures have been brought up so far, but few of them considered the randomization property or offered formal proofs.  ...  The concept of randomization can form a solution for reducing the threat of coercion or bribery in anonymous electronic voting systems based on blind signatures.  ...  The formal proofs for the unlinkability, unforgeability, and randomization properties of the proposed scheme have been provided in this manuscript as well.  ... 
doi:10.1016/j.camwa.2010.01.021 fatcat:m4dztg2efjbexpfup7finwk3wm

A New Protection Scheme for Biometric Templates based on Random Projection and CDMA Principle

Ayoub Lahmidi, Khalid Minaoui, Chouaib Moujahdi, Mohammed Rziza
2021 International Journal of Advanced Computer Science and Applications  
The main idea is to incorporate a discretization tool, namely the spread spectrum technology and in particular the Code Division Multiple Access (CDMA), into a biometric system based on Random Projection  ...  We introduce and demonstrate the proposed scheme as a non-invertible transform, while proving its effectiveness and ability to meet the requirements of revocability and unlinkability.  ...  In our approach, this decomposition assumes an important part, not only in the generation of orthogonal sequences but also in linking each identity to a unique orthogonal code.  ... 
doi:10.14569/ijacsa.2021.0121088 fatcat:gs44sv6sczbrnavux4cd52kpry

A Post-Quantum Biometric Template Protection Scheme based on Learning Parity With Noise (LPN) Commitments

Rosario Arjona, Iluminada Baturone
2020 IEEE Access  
We use the Wide Line Detector implementation from [34] with the parameters =5, =1 and g = 41.  ...  Unlinkability and revocability are based on the variation of the parameters of the transformation functions.  ... 
doi:10.1109/access.2020.3028703 fatcat:f4wobq3jv5dl5f7oh5u4p7gzm4

Predator Perspective Drives Geographic Variation in Frequency-Dependent Polymorphism

Iris A. Holmes, Maggie R. Grundler, Alison R. Davis Rabosky
2017 American Naturalist  
most frequent outcome over the final 50 generations of each unique parameter set).  ...  For each modeled system (four empirically derived systems shown along the top, plus two theoretically possible systems), two polymorphic populations experience migration followed by random breeding and  ... 
doi:10.1086/693159 pmid:28937812 fatcat:ok2ny2vj3zayfhdjyonfv7whbu

How to protect privacy in floating car data systems

Stefan Rass, Simone Fuchs, Martin Schaffer, Kyandoghere Kyamakya
2008 Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking - VANET '08  
Floating Car Data (FCD) is a valuable source of up-to-date traffic information, with a wide range of applications.  ...  The resulting concepts are easy to implement and can be used as building blocks for any FCD system with stringent security constraints.  ...  world wide) unique.  ... 
doi:10.1145/1410043.1410047 dblp:conf/mobicom/RassFSK08 fatcat:sx3x7pf6lnhqhis4rxciqdrt24

Multidevice Authentication with Strong Privacy Protection

Jan Hajny, Petr Dzurenda, Lukas Malina
2018 Wireless Communications and Mobile Computing  
The proposed scheme is provably secure and provides the full set of privacy-enhancing features, that is, the anonymity, untraceability, and unlinkability of users.  ...  The privacy-preserving features are almost missing in these systems.  ...  The algorithm outputs the public system parameters . ( , ) ← Keygen( ): the algorithm is run by the registrar. On the input of public system parameters , it generates its private key and public key .  ... 
doi:10.1155/2018/3295148 fatcat:vydnvw6iubcxrja65fnf2nhiiu

Private Web Search with Constant Round Efficiency

Bolam Kang, Sung Cheol Goh, Myungsun Kim
2015 Proceedings of the 1st International Conference on Information Systems Security and Privacy  
In particular, cryptography-based PWS (CB-PWS) systems provide strong privacy guarantees.  ...  This paper introduces a constant-round CB-PWS protocol which remains computationally efficient, compared to known CB-PWS systems.  ...  Parameter selection. Before giving the comparisons, we fist need to determine the system parameters: the group size (n) and the key size.  ... 
doi:10.5220/0005225602050212 dblp:conf/icissp/KangGK15 fatcat:iqvnhea6dfcv3lvxe36ftar7wy

Dual Hashing Index Cancellable Finger Vein Template Based on Gaussian Random Mapping

Xueyou Hu, Liping Zhang, Huabin Wang, Jian Zhou, Liang Tao
2022 Symmetry  
Second, a random Gaussian projection vector with m×q dimensions was generated, and a random orthogonal projection matrix was generated by the Schmidt orthogonalization of the previously generated random  ...  Therefore, a dual hashing index cancellable finger vein template protection based on Gaussian random mapping is proposed in this study.  ...  the system.  ... 
doi:10.3390/sym14020258 fatcat:xqpbfd5qbrhr7mjmhgrahwqbuu

The Effects of Communication on the Partnership Solution to the Commons

Neil J. Buckley, Stuart Mestelman, R. Andrew Muller, Stephan Schott, Jingjing Zhang
2017 Environmental and Resource Economics  
required to reach the system optimum of 156.  ...  Global communication tends to increase effort and to reduce efficiency when introduced into the Fixed-Partners or Random-Partners treatments but the effect is small and not statistically significant.  ...  There is no unique equilibrium allocation of group effort for individuals in the group but the equilibrium system effort of 156 is unique. 6 This is Prediction 1b.  ... 
doi:10.1007/s10640-017-0124-9 fatcat:cfkjllm5u5et3gqfpu2k3es7te

Improving Unlinkability of Attribute Based Authentication through Game Theory

Yevhen Zolotavkin, Jay Jeong, Veronika Kuchta, Maksym Slavnenko, Robin Doss
using their assertions at random.  ...  This paper first formalizes the problem of unlinkable attribute-based authentication in the system where each user possess multiple assertions and uses them interchangeably.  ...  First, unlinkability achievable in tenable game is better than in randomized scenario, but it is worse than naïve game performance.  ... 
doi:10.6084/m9.figshare.14610372.v1 fatcat:egdp53ctxvfifncy6tp2pimtva

Relations among Security Metrics for Template Protection Algorithms [article]

Manabu Inuma, Akira Otsuka
2013 arXiv   pre-print
Widely-used template protection systems for biometric authentication systems are tamper-proof hardware-based systems, where biometric template is stored in an ordinary storage as an encrypted form and  ...  They demonstrated that fuzzy schemes have strong irreversibility in a practical parameter setting, but introduced impractical assumptions.  ... 
arXiv:1212.4195v2 fatcat:w5rsfgjbuja3fonolvxrskjw6e

A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup [chapter]

Christer Andersson, Markulf Kohlweiss, Leonardo A. Martucci, Andriy Panchenko
2008 Lecture Notes in Computer Science  
An attacker who can control arbitrarily many user identities can break the security properties of most conceivable systems. This is called a "Sybil attack".  ...  These pseudonyms do not depend on the continuous availability of a TTP and, they are fully unlinkable.  ...  Cryptographic Related Work Different cryptographic systems can be used to create unlinkable and unique pseudonyms.  ... 
doi:10.1007/978-3-540-79966-5_5 fatcat:k4q4eh772vap7gcj2rlxh73rc4
« Previous Showing results 1 — 15 out of 6,098 results