Efficient and secure image authentication with robustness and versatility
Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has t...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Chen, Haixia [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2020 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Science in China - Heidelberg : Springer, 2001, 63(2020), 12 vom: 11. Nov. |
|---|---|
| Übergeordnetes Werk: |
volume:63 ; year:2020 ; number:12 ; day:11 ; month:11 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11432-020-3007-5 |
|---|
| Katalog-ID: |
SPR042036046 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR042036046 | ||
| 003 | DE-627 | ||
| 005 | 20230507085328.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201118s2020 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11432-020-3007-5 |2 doi | |
| 035 | |a (DE-627)SPR042036046 | ||
| 035 | |a (SPR)s11432-020-3007-5-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Chen, Haixia |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Efficient and secure image authentication with robustness and versatility |
| 264 | 1 | |c 2020 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 | ||
| 520 | |a Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. | ||
| 650 | 4 | |a image authentication |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a image processing |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a cryptography |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a bilinear maps |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Huang, Xinyi |4 aut | |
| 700 | 1 | |a Wu, Wei |4 aut | |
| 700 | 1 | |a Mu, Yi |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Science in China |d Heidelberg : Springer, 2001 |g 63(2020), 12 vom: 11. Nov. |w (DE-627)385614764 |w (DE-600)2142898-0 |x 1862-2836 |7 nnns |
| 773 | 1 | 8 | |g volume:63 |g year:2020 |g number:12 |g day:11 |g month:11 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s11432-020-3007-5 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_32 | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_69 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_73 | ||
| 912 | |a GBV_ILN_74 | ||
| 912 | |a GBV_ILN_90 | ||
| 912 | |a GBV_ILN_95 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_101 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_138 | ||
| 912 | |a GBV_ILN_152 | ||
| 912 | |a GBV_ILN_161 | ||
| 912 | |a GBV_ILN_171 | ||
| 912 | |a GBV_ILN_187 | ||
| 912 | |a GBV_ILN_224 | ||
| 912 | |a GBV_ILN_250 | ||
| 912 | |a GBV_ILN_281 | ||
| 912 | |a GBV_ILN_285 | ||
| 912 | |a GBV_ILN_293 | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a GBV_ILN_602 | ||
| 912 | |a GBV_ILN_702 | ||
| 951 | |a AR | ||
| 952 | |d 63 |j 2020 |e 12 |b 11 |c 11 | ||
| author_variant |
h c hc x h xh w w ww y m ym |
|---|---|
| matchkey_str |
article:18622836:2020----::fiinadeuemgatetctowtrbsn |
| hierarchy_sort_str |
2020 |
| publishDate |
2020 |
| allfields |
10.1007/s11432-020-3007-5 doi (DE-627)SPR042036046 (SPR)s11432-020-3007-5-e DE-627 ger DE-627 rakwb eng Chen, Haixia verfasserin aut Efficient and secure image authentication with robustness and versatility 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. image authentication (dpeaa)DE-He213 image processing (dpeaa)DE-He213 cryptography (dpeaa)DE-He213 bilinear maps (dpeaa)DE-He213 Huang, Xinyi aut Wu, Wei aut Mu, Yi aut Enthalten in Science in China Heidelberg : Springer, 2001 63(2020), 12 vom: 11. Nov. (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:63 year:2020 number:12 day:11 month:11 https://dx.doi.org/10.1007/s11432-020-3007-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 AR 63 2020 12 11 11 |
| spelling |
10.1007/s11432-020-3007-5 doi (DE-627)SPR042036046 (SPR)s11432-020-3007-5-e DE-627 ger DE-627 rakwb eng Chen, Haixia verfasserin aut Efficient and secure image authentication with robustness and versatility 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. image authentication (dpeaa)DE-He213 image processing (dpeaa)DE-He213 cryptography (dpeaa)DE-He213 bilinear maps (dpeaa)DE-He213 Huang, Xinyi aut Wu, Wei aut Mu, Yi aut Enthalten in Science in China Heidelberg : Springer, 2001 63(2020), 12 vom: 11. Nov. (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:63 year:2020 number:12 day:11 month:11 https://dx.doi.org/10.1007/s11432-020-3007-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 AR 63 2020 12 11 11 |
| allfields_unstemmed |
10.1007/s11432-020-3007-5 doi (DE-627)SPR042036046 (SPR)s11432-020-3007-5-e DE-627 ger DE-627 rakwb eng Chen, Haixia verfasserin aut Efficient and secure image authentication with robustness and versatility 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. image authentication (dpeaa)DE-He213 image processing (dpeaa)DE-He213 cryptography (dpeaa)DE-He213 bilinear maps (dpeaa)DE-He213 Huang, Xinyi aut Wu, Wei aut Mu, Yi aut Enthalten in Science in China Heidelberg : Springer, 2001 63(2020), 12 vom: 11. Nov. (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:63 year:2020 number:12 day:11 month:11 https://dx.doi.org/10.1007/s11432-020-3007-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 AR 63 2020 12 11 11 |
| allfieldsGer |
10.1007/s11432-020-3007-5 doi (DE-627)SPR042036046 (SPR)s11432-020-3007-5-e DE-627 ger DE-627 rakwb eng Chen, Haixia verfasserin aut Efficient and secure image authentication with robustness and versatility 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. image authentication (dpeaa)DE-He213 image processing (dpeaa)DE-He213 cryptography (dpeaa)DE-He213 bilinear maps (dpeaa)DE-He213 Huang, Xinyi aut Wu, Wei aut Mu, Yi aut Enthalten in Science in China Heidelberg : Springer, 2001 63(2020), 12 vom: 11. Nov. (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:63 year:2020 number:12 day:11 month:11 https://dx.doi.org/10.1007/s11432-020-3007-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 AR 63 2020 12 11 11 |
| allfieldsSound |
10.1007/s11432-020-3007-5 doi (DE-627)SPR042036046 (SPR)s11432-020-3007-5-e DE-627 ger DE-627 rakwb eng Chen, Haixia verfasserin aut Efficient and secure image authentication with robustness and versatility 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. image authentication (dpeaa)DE-He213 image processing (dpeaa)DE-He213 cryptography (dpeaa)DE-He213 bilinear maps (dpeaa)DE-He213 Huang, Xinyi aut Wu, Wei aut Mu, Yi aut Enthalten in Science in China Heidelberg : Springer, 2001 63(2020), 12 vom: 11. Nov. (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:63 year:2020 number:12 day:11 month:11 https://dx.doi.org/10.1007/s11432-020-3007-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 AR 63 2020 12 11 11 |
| language |
English |
| source |
Enthalten in Science in China 63(2020), 12 vom: 11. Nov. volume:63 year:2020 number:12 day:11 month:11 |
| sourceStr |
Enthalten in Science in China 63(2020), 12 vom: 11. Nov. volume:63 year:2020 number:12 day:11 month:11 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
image authentication image processing cryptography bilinear maps |
| isfreeaccess_bool |
false |
| container_title |
Science in China |
| authorswithroles_txt_mv |
Chen, Haixia @@aut@@ Huang, Xinyi @@aut@@ Wu, Wei @@aut@@ Mu, Yi @@aut@@ |
| publishDateDaySort_date |
2020-11-11T00:00:00Z |
| hierarchy_top_id |
385614764 |
| id |
SPR042036046 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR042036046</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230507085328.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201118s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11432-020-3007-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR042036046</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11432-020-3007-5-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chen, Haixia</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient and secure image authentication with robustness and versatility</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">image authentication</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">image processing</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">cryptography</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bilinear maps</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Huang, Xinyi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Wei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mu, Yi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Science in China</subfield><subfield code="d">Heidelberg : Springer, 2001</subfield><subfield code="g">63(2020), 12 vom: 11. Nov.</subfield><subfield code="w">(DE-627)385614764</subfield><subfield code="w">(DE-600)2142898-0</subfield><subfield code="x">1862-2836</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:63</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:12</subfield><subfield code="g">day:11</subfield><subfield code="g">month:11</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11432-020-3007-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">63</subfield><subfield code="j">2020</subfield><subfield code="e">12</subfield><subfield code="b">11</subfield><subfield code="c">11</subfield></datafield></record></collection>
|
| author |
Chen, Haixia |
| spellingShingle |
Chen, Haixia misc image authentication misc image processing misc cryptography misc bilinear maps Efficient and secure image authentication with robustness and versatility |
| authorStr |
Chen, Haixia |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)385614764 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1862-2836 |
| topic_title |
Efficient and secure image authentication with robustness and versatility image authentication (dpeaa)DE-He213 image processing (dpeaa)DE-He213 cryptography (dpeaa)DE-He213 bilinear maps (dpeaa)DE-He213 |
| topic |
misc image authentication misc image processing misc cryptography misc bilinear maps |
| topic_unstemmed |
misc image authentication misc image processing misc cryptography misc bilinear maps |
| topic_browse |
misc image authentication misc image processing misc cryptography misc bilinear maps |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Science in China |
| hierarchy_parent_id |
385614764 |
| hierarchy_top_title |
Science in China |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)385614764 (DE-600)2142898-0 |
| title |
Efficient and secure image authentication with robustness and versatility |
| ctrlnum |
(DE-627)SPR042036046 (SPR)s11432-020-3007-5-e |
| title_full |
Efficient and secure image authentication with robustness and versatility |
| author_sort |
Chen, Haixia |
| journal |
Science in China |
| journalStr |
Science in China |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2020 |
| contenttype_str_mv |
txt |
| author_browse |
Chen, Haixia Huang, Xinyi Wu, Wei Mu, Yi |
| container_volume |
63 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Chen, Haixia |
| doi_str_mv |
10.1007/s11432-020-3007-5 |
| title_sort |
efficient and secure image authentication with robustness and versatility |
| title_auth |
Efficient and secure image authentication with robustness and versatility |
| abstract |
Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| abstractGer |
Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| abstract_unstemmed |
Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required. © Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 |
| container_issue |
12 |
| title_short |
Efficient and secure image authentication with robustness and versatility |
| url |
https://dx.doi.org/10.1007/s11432-020-3007-5 |
| remote_bool |
true |
| author2 |
Huang, Xinyi Wu, Wei Mu, Yi |
| author2Str |
Huang, Xinyi Wu, Wei Mu, Yi |
| ppnlink |
385614764 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11432-020-3007-5 |
| up_date |
2024-07-04T00:32:52.694Z |
| _version_ |
1803606475612880896 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR042036046</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230507085328.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201118s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11432-020-3007-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR042036046</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11432-020-3007-5-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chen, Haixia</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient and secure image authentication with robustness and versatility</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Image authentication is the technology of verifying image origin, integrity and authenticity. A rich stream of research on image authentication has shown various trade-off among four favorable features, namely robustness, security, versatility and efficiency. Image data authentication has the highest level of security but provides no robustness/versatility. Image content authentication from robust hashing keeps robust to limited types of operations, and as a result its versatility is not satisfactory. Existing designs of image content authentication from advanced cryptographic primitives achieve robustness, security and versatility, at the cost of low efficiency. In this paper, we present a new design of image authentication with an improved trade-off among the aforementioned features. Our versatile design is robust to a number of predefined image processing operations. Its security can be reduced to q-strong Diffie-Hellman (q-SDH), a complexity problem used by existing cryptographic algorithms. From the aspect of efficiency, the new design has a constant-size authentication overhead (⩽ 2 kB) and a constant verification time (around 0.05 s). While the time of generating authentication overhead increases linearly with the number of permissible editing operations, it only takes around 0.33 s for 1000 types of permissible operations. We believe the new design will facilitate image applications where trustworthy image editing is required.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">image authentication</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">image processing</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">cryptography</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bilinear maps</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Huang, Xinyi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Wei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mu, Yi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Science in China</subfield><subfield code="d">Heidelberg : Springer, 2001</subfield><subfield code="g">63(2020), 12 vom: 11. Nov.</subfield><subfield code="w">(DE-627)385614764</subfield><subfield code="w">(DE-600)2142898-0</subfield><subfield code="x">1862-2836</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:63</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:12</subfield><subfield code="g">day:11</subfield><subfield code="g">month:11</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11432-020-3007-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">63</subfield><subfield code="j">2020</subfield><subfield code="e">12</subfield><subfield code="b">11</subfield><subfield code="c">11</subfield></datafield></record></collection>
|
| score |
7.397312 |