Cryptography最新文献_第8页

Chaotic Function Based ECG Encryption System 基于混沌函数的心电加密系统

IF 1.6

Cryptography Pub Date : 2020-01-01 DOI: 10.4018/978-1-5225-0920-2.CH013

B. P. Singh, Manjit Singh, Dixit Sharma

引用次数: 3

Video Saliency Detection for Visual Cryptography-Based Watermarking 基于视觉密码的视频显著性水印检测

IF 1.6

Cryptography Pub Date : 2020-01-01 DOI: 10.4018/978-1-4666-8723-3.CH006

Adrita Barari, S. Dhavale

引用次数: 0

A Contemplator on Topical Image Encryption Measures 局部图像加密措施的思考

IF 1.6

Cryptography Pub Date : 2020-01-01 DOI: 10.4018/978-1-5225-2296-6.CH009

J. Mondal, Debabala Swain

引用次数: 2

Provable Security for Public Key Cryptosystems 公钥密码系统的可证明安全性

IF 1.6

Cryptography Pub Date : 2020-01-01 DOI: 10.4018/978-1-7998-1763-5.ch013

Syed Taqi Ali

{"title":"Provable Security for Public Key Cryptosystems","authors":"Syed Taqi Ali","doi":"10.4018/978-1-7998-1763-5.ch013","DOIUrl":"https://doi.org/10.4018/978-1-7998-1763-5.ch013","url":null,"abstract":"In the early years after the invention of public key cryptography by Diffie and Hellman in 1976, the design and evaluation of public key cryptosystems has been done merely in ad-hoc manner based on trial and error. The public key cryptosystem said to be secure as long as there is no successful cryptanalytic attack on it. But due to various successful attacks on the cryptosystems after development, the cryptographic community understood that this ad-hoc approach might not be good enough. The paradigm of provable security is an attempt to get rid of ad hoc design. The goals of provable security are to define appropriate models of security on the one hand, and to develop cryptographic designs that can be proven to be secure within the defined models on the other. There are two general approaches for structuring the security proof. One is reductionist approach and other is game-based approach. In these approaches, the security proofs reduce a well known problem (such as discrete logarithm, RSA) to an attack against a proposed cryptosystem. With this approach, the security of public key cryptosystem can be proved formally under the various models viz. random oracle model, generic group model and standard model. In this chapter, we will briefly explain these approaches along with the security proofs of well known public key cryptosystems under the appropriate model.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70443023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Shannon’s Theory, Perfect Secrecy, and the One-Time Pad 香农理论，完全保密，一次性笔记本

IF 1.6

Cryptography Pub Date : 2018-08-14 DOI: 10.1201/9781315282497-3

Douglas R Stinson, Maura B. Paterson

引用次数: 0

Signature Schemes 签名方案

IF 1.6

Cryptography Pub Date : 2018-08-14 DOI: 10.1201/9781315282497-8

Douglas R Stinson, Maura B. Paterson

引用次数: 3

Post-Quantum Cryptography Post-Quantum密码学