Filters








24,384 Hits in 5.9 sec

A new class of optimal 3-splitting authentication codes

Jinhua Wang
2007 Designs, Codes and Cryptography  
In the paper A new class of optimal 3-splitting authentication codes, (Designs, Codes and Cryptography, 38, 373-381, 2006), the proof of Lemma 2.3 is wrong. We give its correction as follows.  ...  Lemma 2.3 There exists a (109, 3 × 3, 1)-cyclic splitting BIBD.  ...  The online version of the original article can be found under doi: 10.1007/s10623-005-1501-x.  ... 
doi:10.1007/s10623-007-9104-3 fatcat:a2jqgnmawnfkhdipqtoy5m6se4

Splitting authentication codes with perfect secrecy: New results, constructions and connections with algebraic manipulation detection codes

Maura B. Paterson, Douglas R. Stinson
2021 Advances in Mathematics of Communications  
<p style='text-indent:20px;'>A splitting BIBD is a type of combinatorial design that can be used to construct splitting authentication codes with good properties.  ...  Motivated by the study of algebraic manipulation detection (AMD) codes, we define the concept of a <i>group generated</i> splitting authentication code.  ...  Acknowledgments We thank Peter Dukes for bringing his paper [2] to our attention and for suggesting that it can be used to prove asymptotic existence of equitably ordered splitting BIBDs.  ... 
doi:10.3934/amc.2021054 fatcat:5qza23l3irh2bhnpdmkxwusnfm

Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes [article]

Maura B. Paterson, Douglas R. Stinson
2021 arXiv   pre-print
A splitting BIBD is a type of combinatorial design that can be used to construct splitting authentication codes with good properties.  ...  Motivated by the study of algebraic manipulation detection (AMD) codes, we define the concept of a group generated splitting authentication code.  ...  Acknowledgements We thank Peter Dukes for bringing his paper [2] to our attention and for suggesting that it can be used to prove asymptotic existence of equitably ordered splitting BIBDs.  ... 
arXiv:2104.11076v2 fatcat:m37xx5a2tvcttbe2zhidd7mehi

Combinatorial Designs for Authentication and Secrecy Codes

Michael Huber
2008 Foundations and Trends in Communications and Information Theory  
This work was supported by the Deutsche Forschungsgemeinschaft (DFG) via a Heisenberg grant (Hu954/4) and a Heinz Maier-Leibnitz Prize grant (Hu954/5).  ...  Douglas Stinson, University of Waterloo, for an inspiring conversation on this topic. I am also indebted to the Editor-in-Chief Prof.  ...  We summarize in Table 3 .3 the infinite classes of optimal codes constructed in this subsection. Moreover, we present further optimal codes with these properties in Table 3 .4.  ... 
doi:10.1561/0100000044 fatcat:i2ykqtz3zrbnpahelbybq7qlxu

Lower Bounds for Authentication Codes with Splitting [chapter]

Andrea Sgarro
1991 Lecture Notes in Computer Science  
The role of non-deterministic authentication coding (coding with splitting) is discussed; a new substitution attack is put forward which is argued to be more relevant than usual substitution for codes  ...  A reduction theorem is proved which allows to extend "abstract" bounds for impersonation (including the new JS-bound, which is shown to hold on the large class of "abstract" authentication codes) to the  ...  The construction of the new code follows.  ... 
doi:10.1007/3-540-46877-3_25 fatcat:ifnqkeykybcfvebo2e2dyplb6u

On the Classification of Splitting (v, u×c, λ) BIBDs

Stela Zhelezova
2018 Cybernetics and Information Technologies  
The (v, u×c, λ)-splitting balanced incomplete block designs correspond to c-splitting authentication codes. We classify splitting balanced incomplete block designs with definite parameters.  ...  W a n g [19] also use group-divisible designs to obtain a new infinite class of optimal 3-splitting authentication codes ((v, 33, 1)-splitting BIBDs).  ...  A splitting authentication code is c-splitting if |e(s)| = c for any eE, sS. The family of encoding rules of an authentication code is described usually by an bu encoding matrix with entries in M.  ... 
doi:10.2478/cait-2018-0023 fatcat:w3vjldzckrhhnf3ci5ehi4i3au

Authentication and secrecy codes for equiprobable source probability distributions

Michael Huber
2009 2009 IEEE International Symposium on Information Theory  
In particular, we construct an infinite class of optimal authentication codes which are multiple-fold secure against spoofing and simultaneously achieve perfect secrecy.  ...  Almost all of these appear to be the first authentication codes with these properties.  ...  The author gratefully acknowledges support of his work by the Deutsche Forschungsgemeinschaft (DFG) via a Heisenberg grant (Hu954/4) and a Heinz Maier-Leibnitz Prize grant (Hu954/5).  ... 
doi:10.1109/isit.2009.5206028 dblp:conf/isit/Huber09 fatcat:sgaw3d3vabdkjppr2rdzf6itaq

Edge Detector Based Fast Level Decision Algorithm for Intra Prediction of HEVC

Wen Shi, Xiantao Jiang, Tian Song, Takashi Shimamoto
2015 Journal of Signal Processing  
It is mainly composed of a bottom-up level decision method and an efficient decision flow based on an authentic image feature.  ...  This paper proposes a fast algorithm for the intra prediction of HEVC, which can efficiently decide the level on the basis of the roberts-cross edge detector.  ...  A homogeneous region is likely Fig. 3 Proportions of depths for different class sequences to utilize a larger CU size or low-level CUs, and a complex region will be split into smaller CUs with a high  ... 
doi:10.2299/jsp.19.67 fatcat:l6phr3vkojgpper3wrwh7zrrkq

Smartwatch User Authentication by Sensing Tapping Rhythms and Using One-Class DBSCAN

Hanqi Zhang, Xi Xiao, Shiguang Ni, Changsheng Dou, Wei Zhou, Shutao Xia
2021 Sensors  
Based on the DBSCAN clustering algorithm, a new classification method called One-Class DBSCAN is presented. It first seeks core objects and then leverages them to perform user authentication.  ...  In addition, a statistical method for detecting the security level of a tapping rhythm is proposed.  ...  After that, a new instance can be classified according to its distance from the core objects. Algorithm 2 demonstrates the authentication of One-Class DBSCAN.  ... 
doi:10.3390/s21072456 pmid:33918171 fatcat:fcin4ntjzfe7llcimxub6idusm

Optimal Computational Split-state Non-malleable Codes [chapter]

Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran
2015 Lecture Notes in Computer Science  
and Lovett [3] presented an explicit non-malleable code for k = 2 states for messages of arbitrary length (significantly improving upon [17] which only encodes a single bit).  ...  Non-malleable codes are a generalization of classical errorcorrecting codes where the act of "corrupting" a codeword is replaced by a "tampering" adversary.  ...  It is not clear if this approach works for a general class of functions. Chandran et al. [7] also rely on the computational setting in defining their new notion of blockwise non-malleable codes.  ... 
doi:10.1007/978-3-662-49099-0_15 fatcat:kwkwgijg2fbltowranlkrsy7we

Commitment and authentication systems

Alexandre Pinto, André Souto, Armando Matos, Luís Antunes
2009 Designs, Codes and Cryptography  
Then, a proof is given that the resolvable design commitment schemes are a composition of an authentication system and a cipher system and the conclusion follows that this is the case for all optimal commitment  ...  This parallel is then used to analyse an attack against commitment schemes that is the counterpart of the impersonation attack in an authentication system.  ...  Authentication codes without secrecy allow a party to send a message composed of a source value s and an authenticator a such that an attacker has at most a probability α of forging a new message or a  ... 
doi:10.1007/s10623-009-9303-1 fatcat:shc4jf3kw5bkdfoovlc5g7qfr4

Commitment and Authentication Systems [chapter]

Alexandre Pinto, André Souto, Armando Matos, Luís Antunes
2009 Lecture Notes in Computer Science  
Then, a proof is given that the resolvable design commitment schemes are a composition of an authentication system and a cipher system and the conclusion follows that this is the case for all optimal commitment  ...  This parallel is then used to analyse an attack against commitment schemes that is the counterpart of the impersonation attack in an authentication system.  ...  Authentication codes without secrecy allow a party to send a message composed of a source value s and an authenticator a such that an attacker has at most a probability α of forging a new message or a  ... 
doi:10.1007/978-3-642-10230-1_1 fatcat:qlc44i7wtnbnxm2upahkouv2ee

Touch Gesture-Based Active User Authentication Using Dictionaries

Heng Zhang, Vishal M. Patel, Mohammed Fathy, Rama Chellappa
2015 2015 IEEE Winter Conference on Applications of Computer Vision  
Screen touch gesture has been shown to be a promising modality for touch-based active authentication of users of mobile devices.  ...  This suggests a need for applying domain adaptation methods to further improve the performance of the classifiers.  ...  The sparse code x t can then be used to determine the class of y t by computing the following error for each class, e c = y t − Y c x c t 2 , (6) where, x c t is the part of coefficient vector x t that  ... 
doi:10.1109/wacv.2015.35 dblp:conf/wacv/ZhangPFC15 fatcat:lzmf6djbs5b47i3uslubvmedm4

Java™ on the bare metal of wireless sensor devices

Doug Simon, Cristina Cifuentes, Dave Cleal, John Daniels, Derek White
2006 Proceedings of the 2nd international conference on Virtual execution environments - VEE '06  
Authentication of deployed files on the wireless device and migration of applications between devices is also performed by the VM.  ...  Squawk translates standard class file into an internal pre-linked, position independent format that is compact and allows for efficient execution of bytecodes that have been placed into a read-only memory  ...  Thanks also go to Bill Pittori for providing access to a Linux/X86 and ARMv4l machines to compile and collect KVM data, Simon Long for collecting some of the data for this paper, Eric Arseneau and Martin  ... 
doi:10.1145/1134760.1134773 dblp:conf/vee/SimonCCDW06 fatcat:meelg5bunzbwhapzugixdrueqe

Design and Implementation of Deep Learning Based Contactless Authentication System Using Hand Gestures

Aveen Dayal, Naveen Paluru, Linga Reddy Cenkeramaddi, Soumya J., Phaneendra K. Yalavarthy
2021 Electronics  
This work presents the design and implementation of a complete end-to-end deep learning based edge computing system that can verify a user contactlessly using 'authentication code'.  ...  The 'authentication code' is an 'n' digit numeric code and the digits are hand gestures of sign language digits.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/electronics10020182 fatcat:ntkc5wsoajefhe34gvmzupwnye
« Previous Showing results 1 — 15 out of 24,384 results