Articolul precedent |
Articolul urmator |
893 13 |
Ultima descărcare din IBN: 2021-04-21 16:01 |
SM ISO690:2012 MOLDOVYAN, Nikolay, MOLDOVYAN, Alexandr, SHCHERBACOV, Alexei. Deniable-encryption protocol using commutative Transformation. In: Conference on Mathematical Foundations of Informatics, Ed. 2016, 25-30 iulie 2016, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2016, pp. 285-298. ISBN 978‐9975‐4237‐4‐8. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Conference on Mathematical Foundations of Informatics 2016 | ||||||
Conferința "Conference on Mathematical Foundations of Informatics" 2016, Chișinău, Moldova, 25-30 iulie 2016 | ||||||
|
||||||
MSC 2010: 94A60, 11S05 | ||||||
Pag. 285-298 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
It is proposed a new design of the deniable-encryption protocols, which is based on using commutative transformation of messages sent between two parties of communication session. For performing the data encryption there is used a shared key having small size (16 to 56 bits), high security and bi-deniability of the protocol being provided though. The protocol has sufficiently high performance and resists active coercive attacks due to using the shared key. It is designed so that data send via insecure channel during the protocol cannot be used to compute any information about the shared key and the deniable encryption is computationally indistinguishable from probabilistic encryption. |
||||||
Cuvinte-cheie cryptography, encryption, commutative encryption, deniable encryption, shared key, probabilistic encryption |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Moldovyan, N.A.</creatorName> <affiliation>St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, Rusia</affiliation> </creator> <creator> <creatorName>Moldovyan, A.A.</creatorName> <affiliation>St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, Rusia</affiliation> </creator> <creator> <creatorName>Şcerbacov, A.V.</creatorName> <affiliation>Liceul Teoretic „C.Sibirschii” din Chişinău, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Deniable-encryption protocol using commutative Transformation</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2016</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978‐9975‐4237‐4‐8</relatedIdentifier> <subjects> <subject>cryptography</subject> <subject>encryption</subject> <subject>commutative encryption</subject> <subject>deniable encryption</subject> <subject>shared key</subject> <subject>probabilistic encryption</subject> </subjects> <dates> <date dateType='Issued'>2016</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><p>It is proposed a new design of the deniable-encryption protocols, which is based on using commutative transformation of messages sent between two parties of communication session. For performing the data encryption there is used a shared key having small size (16 to 56 bits), high security and bi-deniability of the protocol being provided though. The protocol has sufficiently high performance and resists active coercive attacks due to using the shared key. It is designed so that data send via insecure channel during the protocol cannot be used to compute any information about the shared key and the deniable encryption is computationally indistinguishable from probabilistic encryption.</p></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>