Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/7159
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | De, Shankhadeep | - |
dc.date.accessioned | 2021-07-05T05:59:47Z | - |
dc.date.available | 2021-07-05T05:59:47Z | - |
dc.date.issued | 2020-07 | - |
dc.identifier.citation | 17p. | en_US |
dc.identifier.uri | http://hdl.handle.net/10263/7159 | - |
dc.description | Dissertation under the supervision of Dr. Dr. Debrup Chakraborty,Associate Professor,Cryptology and Security Research Unit | en_US |
dc.description.abstract | The existence of evasion attacks during the test phase of machine learning algorithms repre- sents a signi cant challenge to their deployment and understanding. These attacks are carried out by adding imperceptible perturbations to the inputs to generate adversarial examples. As of now designing good robust classi ers in real life seems very di cult. But so far most of the studies depict the relationship between computational power of adversary and robustness of the classi er. In this report, we have used some of the cryptographic schemes to create robust classi ers and show the dependency of robustness with adversarial budget. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Indian Statistical Institute, Kolkata | en_US |
dc.relation.ispartofseries | Dissertation;;2020-8 | - |
dc.subject | Hash Functions | en_US |
dc.subject | Hoe ding's inequality | en_US |
dc.title | Constructing Robust Classi ers using Cryptographic objects | en_US |
dc.type | Other | en_US |
Appears in Collections: | Dissertations - M Tech (CS) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CS1828_ Shankhadeep De Dissertation.pdf | 323.65 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.