CN110505047A - A kind of double-encryption algorithm for iris feature protection - Google Patents

A kind of double-encryption algorithm for iris feature protection Download PDF

Info

Publication number
CN110505047A
CN110505047A CN201910751345.3A CN201910751345A CN110505047A CN 110505047 A CN110505047 A CN 110505047A CN 201910751345 A CN201910751345 A CN 201910751345A CN 110505047 A CN110505047 A CN 110505047A
Authority
CN
China
Prior art keywords
feature
algorithm
encryption
iris
image
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910751345.3A
Other languages
Chinese (zh)
Other versions
CN110505047B (en
Inventor
张恒
焦文明
张键
李宏然
臧奇颜
陈烽
孙雪娇
徐伟伟
许腾腾
潘家乐
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jiangsu Ocean University
Original Assignee
Jiangsu Ocean University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Jiangsu Ocean University filed Critical Jiangsu Ocean University
Priority to CN201910751345.3A priority Critical patent/CN110505047B/en
Publication of CN110505047A publication Critical patent/CN110505047A/en
Application granted granted Critical
Publication of CN110505047B publication Critical patent/CN110505047B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/04Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/001Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/002Countermeasures against attacks on cryptographic mechanisms
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3226Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using a predetermined code, e.g. password, passphrase or PIN
    • H04L9/3231Biological data, e.g. fingerprint, voice or retina

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Collating Specific Patterns (AREA)
  • Measurement Of The Respiration, Hearing Ability, Form, And Blood Characteristics Of Living Organisms (AREA)

Abstract

The invention discloses a kind of double-encryption algorithm for iris feature protection, the specific steps realized are as follows: the chaotic key sequence of iris region Feature Mapping is used for using chaotic function building;First re-diffusion Encryption Algorithm;Second re-diffusion Encryption Algorithm;Parameter value imports reverse decryption iris region.Algorithm of the invention has fully considered the characteristic high with redundancy that contain much information of iris region, is mapped using chaos system iris region feature;Double-encryption is carried out to chaotic key sequence using dual diffusion system simultaneously; greatly enhance timeliness and safety of the iris feature information in network transmission; individual privacy and information security are protected, the application especially suitable for modernization biological property in places such as production, life, business and high-end secrets.

Description

A kind of double-encryption algorithm for iris feature protection
Technical field:
The present invention relates to Encryption Algorithm field, specially a kind of double-encryption algorithm for iris feature protection.
Background technique:
With becoming increasingly popular for internet concept, personal information security is become more and more important.Biological identification technology is logical The analysis mankind intrinsic physiology or behavioural characteristic are crossed to protect the important way of personal information.The biological property of human body mainly wraps Fingerprint is included, face, iris, sound, gait, signature etc..In recent years, it is obtained using fingerprint and face as the biological identification technology of representative It is widely applied.In public safety field, but there are still some limitations in application process, the uniqueness of iris recognition and Stability compensates for these deficiencies.
In many cases, iris may be the bio-identification function that can uniquely identify identity.A series of international research Show that iris recognition is current most safe, most accurate recognition methods.With fingerprint error rate 0.8%, face error rate about 2% It compares, iris error rate can be down to 1%.Omnipotent iris function is the highest level of current biological identification technology.Academia and quotient Increasingly pay attention to the identity recognizing technology extracted based on iris feature in boundary.Iris recognition is gradually applied to high safety performance Certain departments, such as banking system and release mechanism and the more demanding environment of some pairs of authentications.Iris recognition safety Property raising to maintenance society and financial security play an important role.
In network transmission process, due to the insecurity of iris image information, malicious attacker has an opportunity to reveal or break Bad original image information.Since iris image is unique and immutable, once iris image is stolen, our privacy letter There may be the risks disclosed for a long time for breath.It is arranged in face of the malicious sabotage of iris image information and the clumsiness of victim's personal information Diction, the means for improving iris image safety are still problem in the urgent need to address.
Summary of the invention:
The purpose of the present invention is in view of the drawbacks of the prior art, provide a kind of double-encryption calculation for iris feature protection Method, to solve the problems, such as that above-mentioned background technique proposes.
To achieve the above object, the invention provides the following technical scheme: a kind of double-encryption for iris feature protection Algorithm, comprising the following steps:
Step (1): the chaotic key sequence of iris region Feature Mapping is used for using chaotic function building;
Step (2): the first re-diffusion Encryption Algorithm;
Step (3): the second re-diffusion Encryption Algorithm;
Step (4): parameter value imports reverse decryption iris region.
As a preferred technical solution of the present invention, utilize chaotic function building for iris in the step (1) The chaotic function feature of the chaotic key sequence of provincial characteristics mapping are as follows:
Feature (1a): sensitive to primary condition;
Feature (1b): must be Topologically mixing structure;
Feature (1c): at least one intensive periodic orbit.
As a preferred technical solution of the present invention, the master of the spread spectrum encryption in the step (2) and the step (3) Algorithm steps are wanted to be divided into:
Step (2a): scramble information is carried out to plaintext by common scrambling algorithm;
Step (2b): calculating is diffused to image pixel by common broadcast algorithm.
Spread spectrum encrypted feature as a preferred technical solution of the present invention, in the step (2) and the step (3) Are as follows:
Assuming that the pixel sequence for the original plaintext image to be encrypted by P (k) | k=1,2 ..., m } indicate;Chaotic key Sequence is indicated by W;Step (2) diffusion encryption after obtain ciphertext image pixel sequence by Q (k) | k=1, 2 ..., m } it indicates;Step (3) diffusion encryption after obtain final ciphertext image pixel sequence by R (k) | k=1, 2 ..., m } it indicates:
Feature (3a): in the diffusion ciphering process of step (3), without straight between final ciphertext R (k) and original plaintext P (k) Connect connection;
Feature (3b): W (k) can not be inverted using the encryption formula of step (3);
Feature (3c): in each ciphering process, there are XOR operations and non-linear " mould " to transport between ciphertext and plaintext It calculates.
Reverse decryption iris region algorithm characteristics as a preferred technical solution of the present invention, in the step (4) Are as follows:
Feature (4a): input decipherment algorithm main contents are chaotic key sequence, encryption parameter value and final key;
Feature (4b): initial key is identical with all parameter values during encryption and decryption processes;
Feature (4c): final decrypted image is identical with encrypted image.
As a preferred technical solution of the present invention, the scrambling algorithms in the step (2a) are divided into:
(2a1): Arnold conversion scrambling: the image for being N × N for size, the home position [x of pixel0,y0] logical Cross the new location of pixels [x of reversible 2-dimensional matrix acquisition1,y1];
(2a2): Baker transformation scrambling: mapping image by horizontal stretch image and then vertical folding image, and repeating should Process all changes until the position of all pixels.
As a preferred technical solution of the present invention, the broadcast algorithm in the step (2b) is broadly divided into:
(2b1): the XOR between pixel;
(2b1): increase modular arithmetic between the pixels.
Beneficial effects of the present invention: the characteristic information in order to protect iris image, we use chaos encryption pattern die first Iris region is pasted, to protect the iris information during network, is then encrypted using dual diffusion.The chaotic maps of neotectonics produce Raw sequence Distribution value is stronger, and chaos characteristic is complex, combining encryption algorithm, and the pixel distribution of iris image can be more Discrete and uniform, the superior performance of each index can be effective against common attack.By histogram analysis picture adjacent with image Correlation between element combines, and fully meets the security requirements of encryption method, is increasingly rooted in the hearts of the people to current information security Development under overall situation has very high researching value and meaning.
Detailed description of the invention:
Fig. 1 is file data Fusion Model flow chart of the present invention;
Fig. 2 is this algorithm simulating result schematic diagram;
Fig. 3 and 4 is the direction phase diagram of the adjacent pixel from iris plaintext image and iris ciphertext image.
Specific embodiment:
The preferred embodiments of the present invention will be described in detail with reference to the accompanying drawing, so that advantages and features of the invention energy It is easier to be understood by those skilled in the art, so as to make a clearer definition of the protection scope of the present invention.
The present invention provides a kind of technical solution: a kind of double-encryption algorithm for iris feature protection:
The following steps are included:
Step (1): the chaotic key sequence of iris region Feature Mapping is used for using chaotic function building, wherein chaos letter It is several to be characterized in that:
(1a): sensitive to primary condition;
(1b): must be Topologically mixing structure;
(1c): at least one intensive periodic orbit;
Step (2): the first re-diffusion Encryption Algorithm spreads the step of encrypting are as follows:
(2a): scramble information is carried out to plaintext by common scrambling algorithm, scrambling algorithm mainly has:
(2a1) Arnold conversion scrambling: the image for being N × N for size, the home position [x of pixel0,y0] pass through New location of pixels [the x that reversible 2-dimensional matrix obtains1,y1];
(2a2) Baker transformation scrambling: mapping image by horizontal stretch image and then vertical folding image, and repeating should Process all changes until the position of all pixels.
(2b): calculating is diffused to image pixel by common broadcast algorithm, broadcast algorithm mainly has:
XOR between (2b1) pixel;
(2b1) increases modular arithmetic between the pixels.
Step (3): the second re-diffusion Encryption Algorithm spreads encryption and is characterized in that:
Assuming that the pixel sequence for the original plaintext image to be encrypted by P (k) | k=1,2 ..., m } indicate;Chaotic key Sequence is indicated by W;Step (2) diffusion encryption after obtain ciphertext image pixel sequence by Q (k) | k=1, 2 ..., m } it indicates;Step (3) diffusion encryption after obtain final ciphertext image pixel sequence by R (k) | k=1, 2 ..., m } it indicates:
Feature (3a): in the diffusion ciphering process of step (3), final ciphertext R (k) and original plaintext [x0,y0] between do not have Directly contact;
Feature (3b): W (k) can not be inverted using the encryption formula of step (3);
Feature (3c): in each ciphering process, there are XOR operations and non-linear " mould " to transport between ciphertext and plaintext It calculates.
Step (4): parameter value imports reverse decryption iris region, and decrypting feature is:
It is chaotic key sequence, encryption parameter value and final key that (4a), which inputs decipherment algorithm main contents,;
Initial key is identical with all parameter values during (4b) encryption and decryption processes;
(4c) final decrypted image is identical with encrypted image.
The size of key space is to measure the important indicator of the anti-attack ability of encipherment scheme.If key space is too small, Encipherment scheme is easy thoroughly to be attacked, and safety is caused to reduce.One good Encryption Algorithm, key space should be enough Greatly, to resist exhaustive attack.Data of the double precision datum in thirty-two bit computer are stored as 64, key space 264×264 =2128Dimension.Even if attacker's 100,000,000 keys of attack per second, it is also desirable to 1014Nian Caineng exhausts entire key space.If it is considered that Reference value, then key space will be bigger and needs the more time.Therefore, the key for the double-encryption algorithm that this patent is proposed Space is safe for exhaustive attack.
The design of algorithm and safety are closely related.Algorithm of good performance can judge to mark according to various known attacks It is quasi-.Select iris figure to encrypt it.Simulation result is as shown in Figure 2.Fig. 2 (a) and Fig. 2 (d) respectively illustrate original image and its Histogram.Fig. 2 (b) and Fig. 2 (e) respectively illustrate encrypted image and its histogram.Fig. 2 (c) and Fig. 2 (f) respectively illustrate solution Close image and its histogram.As can be seen that the histogram distribution of all pixels is very uneven in original image.Encrypt iris figure As intermediate region pixel histogram distribution have good linear relationship, and do not have for encryption iris image statistical analysis Attack provides any clue.Therefore, the Statistical Analysis Attacks to encryption iris image can be effectively prevented.
From level, vertical and diagonal randomly chooses the N in image to adjacent pixel, to test plaintext image and close The correlation of adjacent pixel between texts and pictures picture.
Fig. 3 and 4 is the direction phase diagram of the adjacent pixel from iris plaintext image and iris ciphertext image.Experiment is in rainbow The level of film plaintext image and iris ciphertext image, vertically and diagonally adjacent random collecting 2000 is to adjacent pixel.Fig. 3 shows The pixel for having gone out consecutive points in iris plaintext image is almost equal.The pixel that Fig. 4 shows consecutive points in iris ciphertext image is bright Aobvious difference.
The adjacent pixel of iris plaintext image is highly relevant, and related coefficient is close to 1.Adjacent pixel in iris ciphertext image Low correlation coefficient charts obviously literary statistical nature has been diffused as random ciphertext.The iris ciphertext image that this paper algorithm obtains reaches The purpose of adjacent pixel correlation is destroyed, so that ciphertext has better random distribution characteristic.
The embodiments described above only express several embodiments of the present invention, and the description thereof is more specific and detailed, but simultaneously It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art It says, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to protection of the invention Range.

Claims (7)

1. a kind of double-encryption algorithm for iris feature protection, which comprises the following steps:
Step (1): the chaotic key sequence of iris region Feature Mapping is used for using chaotic function building;
Step (2): the first re-diffusion Encryption Algorithm;
Step (3): the second re-diffusion Encryption Algorithm;
Step (4): parameter value imports reverse decryption iris region.
2. a kind of double-encryption algorithm for iris feature protection according to claim 1, it is characterised in that: the step Suddenly the chaotic function feature using chaotic function building for the chaotic key sequence of iris region Feature Mapping in (1) are as follows:
Feature (1a): sensitive to primary condition;
Feature (1b): must be Topologically mixing structure;
Feature (1c): at least one intensive periodic orbit.
3. a kind of double-encryption algorithm for iris feature protection according to claim 1, it is characterised in that: the step Suddenly the main algorithm step of the spread spectrum encryption in (2) and the step (3) is divided into:
Step (2a): scramble information is carried out to plaintext by common scrambling algorithm;
Step (2b): calculating is diffused to image pixel by common broadcast algorithm.
4. a kind of double-encryption algorithm for iris feature protection according to claim 1, it is characterised in that: the step Suddenly the spread spectrum encrypted feature in (2) and the step (3) are as follows:
Assuming that the pixel sequence for the original plaintext image to be encrypted by P (k) | k=1,2 ..., m } indicate;Chaotic key sequence It is indicated by W;Step (2) diffusion encryption after obtain ciphertext image pixel sequence by Q (k) | k=1,2 ..., m } It indicates;Step (3) diffusion encryption after obtain final ciphertext image pixel sequence by R (k) | k=1,2 ..., m } It indicates:
Feature (3a): in the diffusion ciphering process of step (3), do not join directly between final ciphertext R (k) and original plaintext P (k) System;
Feature (3b): W (k) can not be inverted using the encryption formula of step (3);
Feature (3c): in each ciphering process, there are XOR operations and non-linear " mould " operation between ciphertext and plaintext.
5. a kind of double-encryption algorithm for iris feature protection according to claim 1, it is characterised in that: the step Suddenly the reverse decryption iris region algorithm characteristics in (4) are as follows:
Feature (4a): input decipherment algorithm main contents are chaotic key sequence, encryption parameter value and final key;
Feature (4b): initial key is identical with all parameter values during encryption and decryption processes;
Feature (4c): final decrypted image is identical with encrypted image.
6. the main algorithm step of diffusion encryption according to claim 3, which is characterized in that adding in the step (2a) Algorithm is disturbed to be divided into:
(2a1): Arnold conversion scrambling: the image for being N × N for size, the home position [x of pixel0,y0] by can New location of pixels [the x that inverse two-dimensional matrix obtains1,y1];
(2a2): Baker transformation scrambling: image is mapped by horizontal stretch image and then vertical folding image, repeats the process Until the position of all pixels all changes.
7. the main algorithm step of diffusion encryption according to claim 3, which is characterized in that the expansion in the step (2b) Scattered algorithm is broadly divided into:
(2b1): the XOR between pixel;
(2b1): increase modular arithmetic between the pixels.
CN201910751345.3A 2019-08-14 2019-08-14 Double encryption method for iris feature protection Active CN110505047B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910751345.3A CN110505047B (en) 2019-08-14 2019-08-14 Double encryption method for iris feature protection

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910751345.3A CN110505047B (en) 2019-08-14 2019-08-14 Double encryption method for iris feature protection

Publications (2)

Publication Number Publication Date
CN110505047A true CN110505047A (en) 2019-11-26
CN110505047B CN110505047B (en) 2022-08-23

Family

ID=68587462

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910751345.3A Active CN110505047B (en) 2019-08-14 2019-08-14 Double encryption method for iris feature protection

Country Status (1)

Country Link
CN (1) CN110505047B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11157776B2 (en) * 2019-09-20 2021-10-26 International Business Machines Corporation Systems and methods for maintaining data privacy in a shared detection model system
US11188320B2 (en) 2019-09-20 2021-11-30 International Business Machines Corporation Systems and methods for updating detection models and maintaining data privacy
CN113762077A (en) * 2021-07-19 2021-12-07 沈阳工业大学 Multi-biological-characteristic iris template protection method based on double-hierarchical mapping
US11216268B2 (en) 2019-09-20 2022-01-04 International Business Machines Corporation Systems and methods for updating detection models and maintaining data privacy
CN114781010A (en) * 2022-04-21 2022-07-22 北京工业大学 Privacy protection terminal equipment and privacy protection method

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102693523A (en) * 2012-05-09 2012-09-26 华南理工大学 Image two-grade encrypting method based on double-chaos system
CN104751403A (en) * 2015-04-23 2015-07-01 北京航空航天大学 Multi-chaos system based method of encrypting images related to plaintext
WO2016045217A1 (en) * 2014-09-23 2016-03-31 深圳市汇顶科技股份有限公司 Encryption method and encryption device
CN107330395A (en) * 2017-06-27 2017-11-07 中国矿业大学 A kind of iris image encryption method based on convolutional neural networks
WO2018153317A1 (en) * 2017-02-24 2018-08-30 陈伟 Chaotic map-based digital chaotic encryption method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102693523A (en) * 2012-05-09 2012-09-26 华南理工大学 Image two-grade encrypting method based on double-chaos system
WO2016045217A1 (en) * 2014-09-23 2016-03-31 深圳市汇顶科技股份有限公司 Encryption method and encryption device
CN104751403A (en) * 2015-04-23 2015-07-01 北京航空航天大学 Multi-chaos system based method of encrypting images related to plaintext
WO2018153317A1 (en) * 2017-02-24 2018-08-30 陈伟 Chaotic map-based digital chaotic encryption method
CN107330395A (en) * 2017-06-27 2017-11-07 中国矿业大学 A kind of iris image encryption method based on convolutional neural networks

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
李敏等: "基于虹膜特征密钥的无线传感器网络安全数据融合", 《计算机系统应用》 *
谢国波等: "二次广义cat映射的混合混沌图像加密算法", 《计算机工程与应用》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11157776B2 (en) * 2019-09-20 2021-10-26 International Business Machines Corporation Systems and methods for maintaining data privacy in a shared detection model system
US11188320B2 (en) 2019-09-20 2021-11-30 International Business Machines Corporation Systems and methods for updating detection models and maintaining data privacy
US11216268B2 (en) 2019-09-20 2022-01-04 International Business Machines Corporation Systems and methods for updating detection models and maintaining data privacy
CN113762077A (en) * 2021-07-19 2021-12-07 沈阳工业大学 Multi-biological-characteristic iris template protection method based on double-hierarchical mapping
CN113762077B (en) * 2021-07-19 2024-02-02 沈阳工业大学 Multi-biological feature iris template protection method based on double-grading mapping
CN114781010A (en) * 2022-04-21 2022-07-22 北京工业大学 Privacy protection terminal equipment and privacy protection method

Also Published As

Publication number Publication date
CN110505047B (en) 2022-08-23

Similar Documents

Publication Publication Date Title
Zhu et al. 2D logistic-modulated-sine-coupling-logistic chaotic map for image encryption
Wang et al. An image encryption algorithm based on hyperchaotic system and DNA coding
CN110505047A (en) A kind of double-encryption algorithm for iris feature protection
Mansouri et al. A novel one-dimensional sine powered chaotic map and its application in a new image encryption scheme
Chen et al. Exploiting self-adaptive permutation–diffusion and DNA random encoding for secure and efficient image encryption
Pak et al. A new color image encryption using combination of the 1D chaotic map
Wu et al. Cryptanalysis and enhancements of image encryption based on three-dimensional bit matrix permutation
Ye et al. An effective framework for chaotic image encryption based on 3D logistic map
Deng et al. Analysis and improvement of a hash-based image encryption algorithm
Li et al. Cryptanalysis of a novel bit-level color image encryption using improved 1D chaotic map
Cun et al. A new chaotic image encryption algorithm based on dynamic DNA coding and RNA computing
CN101030852B (en) Method for enciphering and deciphering human-body safety
CN114157772B (en) Digital image encryption method based on space-time chaotic system and half tensor product compressed sensing
Farschi et al. A novel chaotic approach for information hiding in image
Guo et al. Improved reverse zigzag transform and DNA diffusion chaotic image encryption method
Paul et al. Simultaneous encryption of multiple images using pseudo-random sequences generated by modified Newton-Raphson technique
Elamir et al. Hybrid image encryption scheme for secure E-health systems
Ye et al. Research on reversible image steganography of encrypted image based on image interpolation and difference histogram shift
Singh et al. Deep learning-based biometric image feature extraction for securing medical images through data hiding and joint encryption–compression
Blesswin et al. Secured communication method using visual secret sharing scheme for color images
Man et al. Medical image encryption scheme based on self‐verification matrix
Sekar et al. Hybrid chaos-based image encryption algorithm using Chebyshev chaotic map with deoxyribonucleic acid sequence and its performance evaluation.
Siswanto et al. Chaotic-based encryption algorithm using henon and logistic maps for fingerprint template protection
CN111131657B (en) Chaos medical image tamper-proof encryption method based on self-verification matrix
CN117478330A (en) Three-party privacy set intersection cardinality solving method based on bilinear mapping and bloom filter

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant