177,891 Hits in 5.5 sec

Context-based texture analysis for secure revocable iris-biometric key generation

C. Rathgeb, A. Uhl
2009 3rd International Conference on Imaging for Crime Detection and Prevention (ICDP 2009)  
Based on the idea of exploiting the most reliable components of iriscodes, cryptographic keys are extracted, long enough to be applied in common cryptosystems.  ...  The main benefit of our system is that cryptographic keys are directly derived from biometric data, thus, neither plain biometric data nor encrypted biometric data has to be stored in templates.  ...  By applying appropriate error correction decoding we detect and correct a number of incorrect bits (depending of the applied error correcting code) of the extracted cryptographic keys if the total number  ... 
doi:10.1049/ic.2009.0229 dblp:conf/icdp/RathgebU09 fatcat:c4uzec6q7raudpbuphzygb4h4u

Retrieving secrets from iris fuzzy commitment

Xuebing Zhou, Arjan Kuijper, Christoph Busch
2012 2012 5th IAPR International Conference on Biometrics (ICB)  
This work shows that distribution analysis is essential for security assessment of fuzzy commitment. Ignoring the dependency of binary features can lead to overestimation of the security.  ...  Despite the successful implementation, the dependency existing in iris codes can strongly reduce the security of fuzzy commitment.  ...  After carefully analysing error patterns of iris codes, they applied a two-layer error correction method: Hadamard codes are used to correct random errors caused by capture devices or iris distortions;  ... 
doi:10.1109/icb.2012.6199814 dblp:conf/icb/ZhouKB12 fatcat:f3cjf7efejaatdkg6ijlro7xwy

Systematic Low Leakage Coding for Physical Unclonable Functions

Matthias Hiller, Meng-Day Mandel Yu, Michael Pehl
2015 Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security - ASIA CCS '15  
We present an improved secure sketch construction with our new optimal syndrome coding scheme for PUFs, Systematic Low Leakage Coding (SLLC).  ...  Our scheme provides inherent information theoretic security without the need of a hash function or strong extractor, and optimal asymptotic performance concerning maximum key size and minimum helper data  ...  Acknowledgements The authors would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1145/2714576.2714588 dblp:conf/ccs/HillerYP15 fatcat:wyovxxz4ljawjp5oiuvpdig4pu

A Survey on Secrete Communication through QR Code Steganography for Military Application

Nikita Bhoskar
2022 International Journal for Research in Applied Science and Engineering Technology  
Keywords: Hashing, partitioning algorithm, error correction capacity, high security, Quick Response code, visual secret sharing scheme  ...  An existing sharing technique is subjected to loss of security.  ...  Furthermore, the format information areas contain error correction level and mask pattern. The code version and error correction bits are stored in the version information areas.  ... 
doi:10.22214/ijraset.2022.39907 fatcat:wp7apgi4dzdwxhcnleidex2fty

Universal secure error-correcting schemes for network coding

Danilo Silva, Frank R. Kschischang
2010 2010 IEEE International Symposium on Information Theory  
The goal of the system is to achieve zero-error communication that is information-theoretically secure from the adversary.  ...  This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer.  ...  The reason is that, if error control coding is followed by security coding, the overall codeword may not be robust to errors and, similarly, if security coding is followed by error control coding, the  ... 
doi:10.1109/isit.2010.5513776 dblp:conf/isit/SilvaK10 fatcat:bjxkbbdgovcx5nt5w7khjztz7a

Coding With Scrambling, Concatenation, and HARQ for the AWGN Wire-Tap Channel: A Security Gap Analysis

Marco Baldi, Marco Bianchi, Franco Chiaraluce
2012 IEEE Transactions on Information Forensics and Security  
in addition to the bit error rate.  ...  The amount of degradation of Eve's channel with respect to Bob's that is needed to achieve sufficient security can be further reduced by implementing scrambling and descrambling operations on blocks of  ...  a density w/k ≥ 0.26 was necessary; see Section III-A). 2) Scrambling of concatenated frames: Block-based scrambling can also be applied to transmissions adopting t-error correcting codes with hard-decision  ... 
doi:10.1109/tifs.2012.2187515 fatcat:6hk3ylklm5auboa463okynslwm

Analysis of short blocklength codes for secrecy

Willie K. Harrison, Dinis Sarmento, João P. Vilela, Marco A. C. Gomes
2018 EURASIP Journal on Wireless Communications and Networking  
Our metrics go beyond some of the known practical secrecy measures, such as bit error rate and security gap, so as to make lower bound probabilistic guarantees on error rates over short blocklengths both  ...  We also show how the new metrics provide techniques for reducing realistic channel models to simpler discrete memoryless wiretap channel equivalents over which existing secrecy code designs may achieve  ...  Availability of data and materials Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.  ... 
doi:10.1186/s13638-018-1276-1 fatcat:c434zukx25ezjm3rlt4mnp7q4q

New 2-D interleaving grouping LBC applied on image transmission

Wurod Qasim Mohamed, Marwa Al–Sultani, Haraa Raheem Hatem
2021 International Journal of Power Electronics and Drive Systems (IJPEDS)  
This paper is applied and discussed two different techniques to achieve these requirements, which are linear block code (LBC) and two-dimensions (2-D) interleaving approach.  ...  We investigate a new approach of 2-D interleaving that increases the security of the image transmission and helps to diminution the bit error probability (BER).  ...  A new interleaving approach achieves ultra-security of transmitting information and helps the coding process to detect and correct the error bits up to the interleaving index [16] .  ... 
doi:10.11591/ijece.v11i5.pp4241-4249 fatcat:3as7ztyskvgofjlo4y75zthake

Security and efficiency trade-offs for cloud computing and storage

Jian Li, Kai Zhou, Jian Ren
2015 2015 Resilience Week (RWS)  
Moreover, our scheme can detect and correct malicious nodes with much higher error correction efficiency.  ...  For centralized data storage, to address both security and availability issue, distributed storage is an appealing option in that it can ensure file security without requiring data encryption.  ...  layer code can correct t 1 errors.  ... 
doi:10.1109/rweek.2015.7287434 fatcat:7azj677joncqxhqsqouxmjiafa

Secret Key Cryptosystem based on Non-Systematic Polar Codes [article]

Reza Hooshmand
2014 arXiv   pre-print
In fact, the main objective of this study is to achieve an acceptable level of security and reliability through taking advantage of the special properties of polar codes.  ...  Polar codes are a new class of error correcting linear block codes, whose generator matrix is specified by the knowledge of transmission channel parameters, code length and code dimension.  ...  on error correcting codes.  ... 
arXiv:1310.6485v2 fatcat:vk4rqbu5ana33p6ho5pdmnbl34

A 3-layer coding scheme for biometry template protection based on spectral minutiae

Xiaoying Shao, Haiyun Xu, Raymond N.J. Veldhuis, Cornelis H. Slump
2011 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
Each packet is encoded by an Error Detection Code (EDC) and an Error Correction Code (ECC). The packet can only survive if it successfully passes the ECC and EDC decoder.  ...  By applying SM to the FVC2000-DB2 fingerprint database, the unprotected system achieves an EER of around 6% while our proposed coding scheme reaches an EER of approximately 6.5% with a 1032-bit secret  ...  Therefore, Error Correction Codes (ECCs) have to be adopted together with cryptography to achieve a secure and robust biometric recognition system [3] , [4] .  ... 
doi:10.1109/icassp.2011.5946890 dblp:conf/icassp/ShaoXVS11 fatcat:m5romnd2fvfv5mwl6hsakdqdna

Challenges in Multi-Layer Data Security for Video Steganography Revisited

Samar Kamil, Masri Ayob, Siti Norul Huda Sheikh Abdullah, Zulkifli Ahmad
2018 Asia-Pacific Journal of Information Technology and Multimedia  
To overcome these problems, the cryptography and error correction codes are comes in the pictures and hybrid with steganography algorithms.  ...  The cryptography algorithms add one layer of security on steganography algorithms and error correction codes improves the robustness of steganography algorithms.  ...  ACKNOWLEDGMENT This work was supported by Universiti Kebangsaan Malaysia grant Dana Impak Perdana (DIP-2014-039) and AP.  ... 
doi:10.17576/apjitm-2018-0702(02)-05 fatcat:mhk24mnajreldpyhp4q27yddee

The State-of-the-Art in Iris Biometric Cryptosystems [chapter]

Andreas Uhl, Christian Rathgeb
2011 State of the art in Biometrics  
Hadamard codes are applied to eliminate bit errors originating from the natural variance and Reed-Solomon codes are applied to correct burst errors resulting from distortions.  ...  In the private template scheme helper data are error correction check bits which are applied to correct faulty bits of a given iris-code.  ...  Sook Yoon, as well as a number of anonymous reviewers How to reference In order to correctly reference this scholarly work, feel free to copy and paste the following: Andreas Uhl and Christian Rathgeb  ... 
doi:10.5772/17392 fatcat:7657mhyidferhhhmcsb3oed7dm

Modification of FrodoKEM Using Gray and Error-Correcting Codes

Eunsang Lee, Young-Sik Kim, Jong-Seon No, Minki Song, Dong-Joon Shin
2019 IEEE Access  
There are many cryptosystems that adopt error-correcting codes (ECCs) to improve performance, such as LAC, ThreeBears, and Round5.  ...  In this study, we propose a method to apply ECCs and Gray codes to FrodoKEM by encoding the bits converted from the encrypted symbols.  ...  ACKNOWLEDGMENT We would like to thank anonymous reviewers and the associate editor for their valuable suggestions and comments that helped improve the quality of this paper.  ... 
doi:10.1109/access.2019.2959042 fatcat:kuvb5icbyzcytltwghproxza5y

Analysis of Short Blocklength Codes for Secrecy [article]

Willie K. Harrison and Dinis Sarmento and João P. Vilela and Marco Gomes
2015 arXiv   pre-print
Our metrics go beyond some of the known practical secrecy measures, such as bit error rate and security gap, so as to make lower bound probabilistic guarantees on error rates over short blocklengths both  ...  We also show how the new metrics provide techniques for reducing realistic channel models to simpler discrete memoryless wiretap channel equivalents over which existing secrecy code designs may achieve  ...  The receiving decoders at Bob and Eve apply a softdecoding algorithm for the LDPC code, and the BCH decoder can then correct no more than 10 errors in the key bits.  ... 
arXiv:1509.07092v1 fatcat:k7eblrirgbgxtllshh242bkrwm
« Previous Showing results 1 — 15 out of 177,891 results