Private Eyes: Zero-Leakage Iris Searchable Encryption
暂无分享,去创建一个
[1] Benjamin Fuller,et al. Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric , 2023, Inf. Comput..
[2] Sikhar Patranabis,et al. Rethinking Searchable Symmetric Encryption , 2023, 2023 IEEE Symposium on Security and Privacy (SP).
[3] T. Schneider,et al. SoK: Cryptanalysis of Encrypted Search with LEAKER – A framework for LEakage AttacK Evaluation on Real-world data , 2022, 2022 IEEE 7th European Symposium on Security and Privacy (EuroS&P).
[4] Benjamin Fuller,et al. Proximity Searchable Encryption for the Iris Biometric , 2022, AsiaCCS.
[5] Alexandra Boldyreva,et al. Privacy-Preserving Approximate k-Nearest-Neighbors Search that Hides Access, Query and Volume Patterns , 2021, IACR Cryptol. ePrint Arch..
[6] Roberto Tamassia,et al. Full Database Reconstruction in Two Dimensions , 2020, CCS.
[7] Benjamin Fuller,et al. Resist: Reconstruction of irises from templates , 2020, 2020 IEEE International Joint Conference on Biometrics (IJCB).
[8] Roberto Tamassia,et al. The State of the Uniform: Attacks on Encrypted Databases Beyond the Uniform Query Distribution , 2020, 2020 IEEE Symposium on Security and Privacy (SP).
[9] James Steel,et al. Cryptographic Authentication from the Iris , 2019, ISC.
[10] Roberto Tamassia,et al. Full Database Reconstruction with Access and Search Pattern Leakage , 2019, IACR Cryptol. ePrint Arch..
[11] Sohaib Ahmad,et al. ThirdEye: Triplet Based Iris Recognition without Normalization , 2019, 2019 IEEE 10th International Conference on Biometrics Theory, Applications and Systems (BTAS).
[12] Petros Efstathopoulos,et al. The Case of Adversarial Inputs for Secure Similarity Approximation Protocols , 2019, 2019 IEEE European Symposium on Security and Privacy (EuroS&P).
[13] Nasser M. Nasrabadi,et al. Adversarial Examples to Fool Iris Recognition Systems , 2019, 2019 International Conference on Biometrics (ICB).
[14] Arun Ross,et al. Synthesizing Iris Images Using RaSGAN With Application in Presentation Attack Detection , 2019, 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW).
[15] Ilya P. Razenshteyn,et al. SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search , 2019, IACR Cryptol. ePrint Arch..
[16] Tal Malkin,et al. Lower Bounds for Oblivious Near-Neighbor Search , 2019, IACR Cryptol. ePrint Arch..
[17] Roberto Tamassia,et al. Data Recovery on Encrypted Databases with k-Nearest Neighbor Query Leakage , 2019, 2019 IEEE Symposium on Security and Privacy (SP).
[18] Benjamin Fuller,et al. Unconstrained Iris Segmentation using Convolutional Neural Networks , 2018, ACCV Workshops.
[19] Marie-Sarah Lacharité,et al. Pump up the Volume: Practical Database Reconstruction from Volume Leakage on Range Queries , 2018, CCS.
[20] Yi Huang,et al. From the Perspective of CNN to Adversarial Iris Images , 2018, 2018 IEEE 9th International Conference on Biometrics Theory, Applications and Systems (BTAS).
[21] Alexia Jolicoeur-Martineau,et al. The relativistic discriminator: a key element missing from standard GAN , 2018, ICLR.
[22] Stefanos Zafeiriou,et al. ArcFace: Additive Angular Margin Loss for Deep Face Recognition , 2018, 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR).
[23] Guofeng Wang,et al. Query Recovery Attacks on Searchable Encryption Based on Partial Knowledge , 2017, SecureComm.
[24] Vincent Dumoulin,et al. Generative Adversarial Networks: An Overview , 2017, 1710.07035.
[25] Richa Singh,et al. Synthetic iris presentation attack using iDCGAN , 2017, 2017 IEEE International Joint Conference on Biometrics (IJCB).
[26] Thomas Ristenpart,et al. Leakage-Abuse Attacks against Order-Revealing Encryption , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[27] Robert K. Cunningham,et al. SoK: Cryptographically Protected Database Search , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[28] Pong C. Yuen,et al. On the Reconstruction of Face Images from Deep Face Templates , 2017, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[29] Adam O'Neill,et al. Generic Attacks on Secure Outsourced Databases , 2016, CCS.
[30] Sanjam Garg,et al. TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption , 2016, CRYPTO.
[31] Patrick J. Flynn,et al. The ND-IRIS-0405 Iris Image Dataset , 2016, ArXiv.
[32] Kai-Min Chung,et al. Oblivious Parallel RAM and Applications , 2016, TCC.
[33] Stefano Tessaro,et al. Oblivious Parallel RAM: Improved Efficiency and Generic Constructions , 2016, TCC.
[34] Robert K. Cunningham,et al. Security and Privacy Assurance Research (SPAR) Pilot Final Report , 2015 .
[35] David Cash,et al. Leakage-Abuse Attacks Against Searchable Encryption , 2015, IACR Cryptol. ePrint Arch..
[36] Tal Malkin,et al. Malicious-Client Security in Blind Seer: A Scalable Private DBMS , 2015, 2015 IEEE Symposium on Security and Privacy.
[37] Sergey Ioffe,et al. Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift , 2015, ICML.
[38] Jimmy Ba,et al. Adam: A Method for Stochastic Optimization , 2014, ICLR.
[39] Kartik Nayak,et al. Oblivious Data Structures , 2014, IACR Cryptol. ePrint Arch..
[40] Andreas Peter,et al. A Survey of Provably Secure Searchable Encryption , 2014, ACM Comput. Surv..
[41] Angelos D. Keromytis,et al. Blind Seer: A Scalable Private DBMS , 2014, 2014 IEEE Symposium on Security and Privacy.
[42] John Daugman,et al. 600 million citizens of India are now enrolled with biometric ID , 2014 .
[43] Nathan Chenette,et al. Efficient Fuzzy Search on Encrypted Data , 2014, FSE.
[44] Changyu Dong,et al. When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.
[45] Peter Williams,et al. PrivateFS: a parallel oblivious file system , 2012, CCS.
[46] Murat Kantarcioglu,et al. Efficient Similarity Search over Encrypted Data , 2012, 2012 IEEE 28th International Conference on Data Engineering.
[47] Elaine Shi,et al. Path ORAM: an extremely simple oblivious RAM protocol , 2012, CCS.
[48] Marios Savvides,et al. How to Generate Spoofed Irises From an Iris Code Template , 2011, IEEE Transactions on Information Forensics and Security.
[49] Moti Yung,et al. Efficient robust private set intersection , 2009, Int. J. Appl. Cryptogr..
[50] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.
[51] Benny Pinkas,et al. Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.
[52] John Daugman,et al. How iris recognition works , 2002, IEEE Transactions on Circuits and Systems for Video Technology.
[53] Dawn Xiaodong Song,et al. Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.
[54] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[55] Christopher M. Brislawn,et al. FBI compression standard for digitized fingerprint images , 1996, Optics & Photonics.
[56] William Pugh,et al. Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.
[57] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[58] Cathy L. Schott,et al. Experimental Results , 2009 .
[59] Francesca Falzon,et al. An Efficient Query Recovery Attack Against a Graph Encryption Scheme , 2022, IACR Cryptol. ePrint Arch..
[60] Phillipp Schoppmann,et al. VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE , 2021, IACR Cryptol. ePrint Arch..
[61] Seny Kamara,et al. Cryptanalysis of Encrypted Search with LEAKER - A framework for LEakage AttacK Evaluation on Real-world data , 2021, IACR Cryptol. ePrint Arch..
[62] Andrew L. Maas. Rectifier Nonlinearities Improve Neural Network Acoustic Models , 2013 .
[63] Murat Kantarcioglu,et al. Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation , 2012, NDSS.
[64] Arun Ross,et al. From the Iriscode to the Iris: A New Vulnerability of Iris Recognition Systems , 2012 .
[65] Emiliano De Cristofaro,et al. Practical Private Set Intersection Protocols with Linear Computational and Bandwidth Complexity , 2009, IACR Cryptol. ePrint Arch..
[66] John Daugman,et al. Results from 200 billion iris cross-comparisons , 2005 .
[67] B. Nickerson,et al. On the equivalence of B-trees and deterministic skip list , 1996 .