skip to main content
Skip header Section
Foundations of Cryptography: Volume 2, Basic ApplicationsMay 2004
Publisher:
  • Cambridge University Press
  • 40 W. 20 St. New York, NY
  • United States
ISBN:978-0-521-83084-3
Published:01 May 2004
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Hasan O, Brunie L and Bertino E (2022). Privacy-Preserving Reputation Systems Based on Blockchain and Other Cryptographic Building Blocks: A Survey, ACM Computing Surveys, 55:2, (1-37), Online publication date: 31-Mar-2023.
  2. ACM
    Ranchal-Pedrosa A and Gramoli V Leveraging Democracy to Optimize Distributed Random Beacons Proceedings of the 2022 ACM Workshop on Developments in Consensus, (15-27)
  3. ACM
    Asharov G, Hamada K, Ikarashi D, Kikuchi R, Nof A, Pinkas B, Takahashi K and Tomida J Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (125-138)
  4. ACM
    Roy Chowdhury A, Ding B, Jha S, Liu W and Zhou J Strengthening Order Preserving Encryption with Differential Privacy Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (2519-2533)
  5. ACM
    Güneysu T, Hodges P, Land G, Ounsworth M, Stebila D and Zaverucha G Proof-of-Possession for KEM Certificates using Verifiable Generation Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (1337-1351)
  6. ACM
    Dalskov A, Escudero D and Nof A Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (653-666)
  7. ACM
    Bell J, Gascón A, Ghazi B, Kumar R, Manurangsi P, Raykova M and Schoppmann P Distributed, Private, Sparse Histograms in the Two-Server Model Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, (307-321)
  8. ACM
    Zhou A, Qiu R, Lambert T, Allard T, Ibrahim S and Abbadi A PGPregel Proceedings of the 13th Symposium on Cloud Computing, (386-402)
  9. Desai N, Lal Das M, Chaudhari P and Kumar N (2022). Background knowledge attacks in privacy-preserving data publishing models, Computers and Security, 122:C, Online publication date: 1-Nov-2022.
  10. Xu L, Wei X, Cai G, Li Y and Wang H (2022). SWMQ, International Journal of Intelligent Systems, 37:9, (6262-6282), Online publication date: 30-Jul-2022.
  11. ACM
    Ibarrondo A, Chabanne H, Despiegel V and Önen M Colmade: Collaborative Masking in Auditable Decryption for BFV-based Homomorphic Encryption Proceedings of the 2022 ACM Workshop on Information Hiding and Multimedia Security, (129-139)
  12. ACM
    Wang C, Bater J, Nayak K and Machanavajjhala A IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy Proceedings of the 2022 International Conference on Management of Data, (818-832)
  13. ACM
    Ma X, Ma J, Kumari S, Wei F, Shojafar M and Alazab M (2021). Privacy-Preserving Distributed Multi-Task Learning against Inference Attack in Cloud Computing, ACM Transactions on Internet Technology, 22:2, (1-24), Online publication date: 31-May-2022.
  14. ACM
    Bai J, Song X, Cui S, Chang E and Russello G Scalable Private Decision Tree Evaluation with Sublinear Communication Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, (843-857)
  15. Liang Y, Li Y and Shin B (2022). Decentralized crowdsourcing for human intelligence tasks with efficient on-chain cost, Proceedings of the VLDB Endowment, 15:9, (1875-1888), Online publication date: 1-May-2022.
  16. ACM
    Breuer M, Meyer U and Wetzel S Privacy-Preserving Maximum Matching on General Graphs and its Application to Enable Privacy-Preserving Kidney Exchange Proceedings of the Twelfth ACM Conference on Data and Application Security and Privacy, (53-64)
  17. Tong Y, Pan X, Zeng Y, Shi Y, Xue C, Zhou Z, Zhang X, Chen L, Xu Y, Xu K and Lv W (2022). Hu-Fu, Proceedings of the VLDB Endowment, 15:6, (1159-1172), Online publication date: 1-Feb-2022.
  18. ACM
    Böhler J and Kerschbaum F Secure Multi-party Computation of Differentially Private Heavy Hitters Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, (2361-2377)
  19. ACM
    Malekzadeh M, Borovykh A and Gündüz D Honest-but-Curious Nets: Sensitive Attributes of Private Inputs Can Be Secretly Coded into the Classifiers' Outputs Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, (825-844)
  20. ACM
    Hashemi H, Wang Y and Annavaram M DarKnight: An Accelerated Framework for Privacy and Integrity Preserving Deep Learning Using Trusted Hardware MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture, (212-224)
  21. Asthana R, Walia G and Gupta A (2021). A novel biometric crypto system based on cryptographic key binding with user biometrics, Multimedia Systems, 27:5, (877-891), Online publication date: 1-Oct-2021.
  22. ACM
    Chen C, Zhou J, Wang L, Wu X, Fang W, Tan J, Wang L, Liu A, Wang H and Hong C When Homomorphic Encryption Marries Secret Sharing: Secure Large-Scale Sparse Logistic Regression and Applications in Risk Control Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, (2652-2662)
  23. Liu P, Liu K, Fu T, Zhang Y and Hu J (2021). A privacy-preserving resource trading scheme for Cloud Manufacturing with edge-PLCs in IIoT, Journal of Systems Architecture: the EUROMICRO Journal, 117:C, Online publication date: 1-Aug-2021.
  24. ACM
    Dwork C, Kim M, Reingold O, Rothblum G and Yona G Outcome indistinguishability Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, (1095-1108)
  25. ACM
    Wang C, Bater J, Nayak K and Machanavajjhala A DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy Proceedings of the 2021 International Conference on Management of Data, (1892-1905)
  26. ACM
    Hiwatashi K, Ogura K, Ohata S and Nuida K Accelerating Secure (2+1)-Party Computation by Insecure but Efficient Building Blocks Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security, (616-627)
  27. Feng T, Wang X, Liu C, Fang J and He D (2021). Secure Data Collaborative Computing Scheme Based on Blockchain, Security and Communication Networks, 2021, Online publication date: 1-Jan-2021.
  28. Wiese M and Boche H (2020). Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs, IEEE Transactions on Information Theory, 67:1, (52-80), Online publication date: 1-Jan-2021.
  29. ACM
    Seker O, Berndt S, Wilke L and Eisenbarth T SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, (1033-1049)
  30. ACM
    Tueno A and Kerschbaum F Efficient Secure Computation of Order-Preserving Encryption Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, (193-207)
  31. Ghinita G, Nguyen K, Maruseac M and Shahabi C (2020). A secure location-based alert system with tunable privacy-performance trade-off, Geoinformatica, 24:4, (951-985), Online publication date: 1-Oct-2020.
  32. Agrawal S, Garg R, Kumar N and Prabhakaran M A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing Computer Security – ESORICS 2020, (42-63)
  33. ACM
    Boemer F, Cammarota R, Demmler D, Schneider T and Yalame H MP2ML Proceedings of the 15th International Conference on Availability, Reliability and Security, (1-10)
  34. ACM
    Ferreira M and Weinberg S Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments Proceedings of the 21st ACM Conference on Economics and Computation, (683-712)
  35. Bunn P and Ostrovsky R (2020). Oblivious Sampling with Applications to Two-Party k-Means Clustering, Journal of Cryptology, 33:3, (1362-1403), Online publication date: 1-Jul-2020.
  36. ACM
    Golovnev A, Guo S, Horel T, Park S and Vaikuntanathan V Data structures meet cryptography: 3SUM with preprocessing Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, (294-307)
  37. Sattath O (2020). On the insecurity of quantum Bitcoin mining, International Journal of Information Security, 19:3, (291-302), Online publication date: 1-Jun-2020.
  38. Xiao M, Gao G, Wu J, Zhang S and Huang L (2020). Privacy-Preserving User Recruitment Protocol for Mobile Crowdsensing, IEEE/ACM Transactions on Networking, 28:2, (519-532), Online publication date: 1-Apr-2020.
  39. Liu X, Zhang X, Yu J, Fu C and Cheng H (2020). Query Privacy Preserving for Data Aggregation in Wireless Sensor Networks, Wireless Communications & Mobile Computing, 2020, Online publication date: 1-Jan-2020.
  40. Shamsabadi A, Gascón A, Haddadi H and Cavallaro A (2020). PrivEdge: From Local to Distributed Private Training and Prediction, IEEE Transactions on Information Forensics and Security, 15, (3819-3831), Online publication date: 1-Jan-2020.
  41. Akavia A, LaVigne R and Moran T (2019). Topology-Hiding Computation on All Graphs, Journal of Cryptology, 33:1, (176-227), Online publication date: 1-Jan-2020.
  42. Ci S, Sun L, Liu X, Du T and Zheng X A Secure Density Peaks Clustering Algorithm on Cloud Computing Cyberspace Safety and Security, (533-541)
  43. ACM
    Bernstein D, Hülsing A, Kölbl S, Niederhagen R, Rijneveld J and Schwabe P The SPHINCS+ Signature Framework Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (2129-2146)
  44. ACM
    Boyle E, Gilboa N, Ishai Y and Nof A Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (869-886)
  45. ACM
    Boyle E, Couteau G, Gilboa N, Ishai Y, Kohl L, Rindal P and Scholl P Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (291-308)
  46. ACM
    Ning J, Poh G, Loh J, Chia J and Chang E PrivDPI Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1657-1670)
  47. ACM
    Schoppmann P, Gascón A, Raykova M and Pinkas B Make Some ROOM for the Zeros Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1335-1350)
  48. ACM
    Furukawa J and Lindell Y Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1557-1571)
  49. ACM
    Karakoç F, Nateghizad M and Erkin Z SET-OT Proceedings of the 14th International Conference on Availability, Reliability and Security, (1-9)
  50. Qin L, Lapets A, Jansen F, Flockhart P, Albab K, Globus-Harris I, Roberts S and Varia M From usability to secure computing and back again Proceedings of the Fifteenth USENIX Conference on Usable Privacy and Security, (191-210)
  51. ACM
    Rao F, Cao J, Bertino E and Kantarcioglu M (2019). Hybrid Private Record Linkage, ACM Transactions on Privacy and Security, 22:3, (1-36), Online publication date: 19-Jul-2019.
  52. ACM
    Li Y, Wang H and Zhao Y Delegatable Order-Revealing Encryption Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, (134-147)
  53. ACM
    Alexandru A and Pappas G Encrypted LQG using labeled homomorphic encryption Proceedings of the 10th ACM/IEEE International Conference on Cyber-Physical Systems, (129-140)
  54. Choi S, Katz J, Schröder D, Yerukhimovich A and Zhou H (2019). (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens, Journal of Cryptology, 32:2, (459-497), Online publication date: 1-Apr-2019.
  55. Hazay C, Mikkelsen G, Rabin T, Toft T and Nicolosi A (2019). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting, Journal of Cryptology, 32:2, (265-323), Online publication date: 1-Apr-2019.
  56. Limkar S and Jha R (2019). Computing over encrypted spatial data generated by IoT, Telecommunications Systems, 70:2, (193-229), Online publication date: 1-Feb-2019.
  57. Li H, Jing T and Liu J (2019). A Lightweight Fine-Grained Searchable Encryption Scheme in Fog-Based Healthcare IoT Networks, Wireless Communications & Mobile Computing, 2019, Online publication date: 1-Jan-2019.
  58. Gao C, Cheng Q, Li X and Xia S (2019). Cloud-assisted privacy-preserving profile-matching scheme under multiple keys in mobile social network, Cluster Computing, 22:1, (1655-1663), Online publication date: 1-Jan-2019.
  59. ACM
    Zhu H and Keong N Sustainable Data Management Strategies and Systems in Untrust Cloud Environments Proceedings of the 6th International Conference on Information Technology: IoT and Smart City, (163-167)
  60. ACM
    Canillas R, Talbi R, Bouchenak S, Hasan O, Brunie L and Sarrat L Exploratory Study of Privacy Preserving Fraud Detection Proceedings of the 19th International Middleware Conference Industry, (25-31)
  61. Bater J, He X, Ehrich W, Machanavajjhala A and Rogers J (2018). Shrinkwrap, Proceedings of the VLDB Endowment, 12:3, (307-320), Online publication date: 1-Nov-2018.
  62. ACM
    Chida K, Hamada K, Ikarashi D, Kikuchi R and Pinkas B High-Throughput Secure AES Computation Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, (13-24)
  63. ACM
    Zhao Y and Chow S Can You Find The One for Me? Proceedings of the 2018 Workshop on Privacy in the Electronic Society, (54-65)
  64. ACM
    Dziembowski S, Eckey L and Faust S FairSwap Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (967-984)
  65. ACM
    Dziembowski S, Faust S and Hostáková K General State Channel Networks Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (949-966)
  66. ACM
    Lindell Y and Nof A Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (1837-1854)
  67. ACM
    Kim J, Koo D, Kim Y, Yoon H, Shin J and Kim S (2018). Efficient Privacy-Preserving Matrix Factorization for Recommendation via Fully Homomorphic Encryption, ACM Transactions on Privacy and Security, 21:4, (1-30), Online publication date: 13-Oct-2018.
  68. Hofheinz D, Müller-Quade J and Unruh D (2018). On the (Im-)Possibility of Extending Coin Toss, Journal of Cryptology, 31:4, (1120-1163), Online publication date: 1-Oct-2018.
  69. Li X, Zhu Y, Wang J, Liu Z, Liu Y and Zhang M (2018). On the Soundness and Security of Privacy-Preserving SVM for Outsourcing Data Classification, IEEE Transactions on Dependable and Secure Computing, 15:5, (906-912), Online publication date: 1-Sep-2018.
  70. ACM
    Nateghizad M, Veugen T, Erkin Z and Lagendijk R Secure Equality Testing Protocols in the Two-Party Setting Proceedings of the 13th International Conference on Availability, Reliability and Security, (1-10)
  71. González-Serrano F, Amor-Martín A and Casamayón-Antón J (2018). Supervised machine learning using encrypted training data, International Journal of Information Security, 17:4, (365-377), Online publication date: 1-Aug-2018.
  72. Kikuchi R, Ikarashi D, Matsuda T, Hamada K and Chida K Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority Information Security and Privacy, (64-82)
  73. Lindell Y and Zarosim H (2018). On the Feasibility of Extending Oblivious Transfer, Journal of Cryptology, 31:3, (737-773), Online publication date: 1-Jul-2018.
  74. Lindell Y, Omri E and Zarosim H (2018). Completeness for Symmetric Two-Party Functionalities, Journal of Cryptology, 31:3, (671-697), Online publication date: 1-Jul-2018.
  75. ACM
    Lapets A, Jansen F, Albab K, Issa R, Qin L, Varia M and Bestavros A Accessible Privacy-Preserving Web-Based Data Analysis for Assessing and Addressing Economic Inequalities Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies, (1-5)
  76. ACM
    Riazi M, Weinert C, Tkachenko O, Songhori E, Schneider T and Koushanfar F Chameleon Proceedings of the 2018 on Asia Conference on Computer and Communications Security, (707-721)
  77. Phong L, Aono Y, Hayashi T, Wang L and Moriai S (2018). Privacy-Preserving Deep Learning via Additively Homomorphic Encryption, IEEE Transactions on Information Forensics and Security, 13:5, (1333-1345), Online publication date: 1-May-2018.
  78. Long M, Peng F and Gong X (2018). A Format-Compliant Encryption for Secure HEVC Video Sharing in Multimedia Social Network, International Journal of Digital Crime and Forensics, 10:2, (23-39), Online publication date: 1-Apr-2018.
  79. Liu A, Wang W, Shang S, Li Q and Zhang X (2018). Efficient task assignment in spatial crowdsourcing with worker and task privacy protection, Geoinformatica, 22:2, (335-362), Online publication date: 1-Apr-2018.
  80. Hazay C (2018). Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs, Journal of Cryptology, 31:2, (537-586), Online publication date: 1-Apr-2018.
  81. ACM
    Ramachandran A and Kantarcioglu M SmartProvenance Proceedings of the Eighth ACM Conference on Data and Application Security and Privacy, (35-42)
  82. Wu F, Zilberstein S and Chen X Privacy-preserving policy iteration for decentralized POMDPs Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (4759-4766)
  83. ACM
    Férée H, Hym S, Mayero M, Moyen J and Nowak D Formal proof of polynomial-time complexity with quasi-interpretations Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, (146-157)
  84. Choi S, Dachman-Soled D, Malkin T and Wee H (2018). A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption, Journal of Cryptology, 31:1, (172-201), Online publication date: 1-Jan-2018.
  85. Kamel I, Talha A and Aghbari Z (2017). Dynamic spatial index for efficient query processing on the cloud, Journal of Cloud Computing: Advances, Systems and Applications, 6:1, (1-16), Online publication date: 1-Dec-2017.
  86. Gonzlez-Serrano F, Navia-Vzquez n and Amor-Martn A (2017). Training Support Vector Machines with privacy-protected data, Pattern Recognition, 72:C, (93-107), Online publication date: 1-Dec-2017.
  87. ACM
    Chiesa M, Demmler D, Canini M, Schapira M and Schneider T SIXPACK Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies, (120-133)
  88. Brakerski Z, Halevi S and Polychroniadou A Four Round Secure Computation Without Setup Theory of Cryptography, (645-677)
  89. Daza V and Makriyannis N Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions Theory of Cryptography, (581-611)
  90. Lindell Y and Rabin T Secure Two-Party Computation with Fairness - A Necessary Design Principle Theory of Cryptography, (565-580)
  91. Dong C and Loukides G (2017). Approximating Private Set Union/Intersection Cardinality With Logarithmic Complexity, IEEE Transactions on Information Forensics and Security, 12:11, (2792-2806), Online publication date: 1-Nov-2017.
  92. Aliasgari M, Blanton M and Bayatbabolghani F (2017). Secure computation of hidden Markov models and secure floating-point arithmetic in the malicious model, International Journal of Information Security, 16:6, (577-601), Online publication date: 1-Nov-2017.
  93. ACM
    Fenske E, Mani A, Johnson A and Sherr M Distributed Measurement with Private Set-Union Cardinality Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, (2295-2312)
  94. ACM
    He X, Machanavajjhala A, Flynn C and Srivastava D Composing Differential Privacy and Secure Computation Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, (1389-1406)
  95. ACM
    Lindell Y and Nof A A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, (259-276)
  96. ACM
    Wang X, Ranellucci S and Katz J Global-Scale Secure Multiparty Computation Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, (39-56)
  97. Shi W, Bao Z, Wang J, Lu N, Zhu F and Shen J (2017). A privacy-preserving degree-matching multi-attribute auction scheme in smart grid auction market, Personal and Ubiquitous Computing, 21:5, (779-789), Online publication date: 1-Oct-2017.
  98. Cohen R and Lindell Y (2017). Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation, Journal of Cryptology, 30:4, (1157-1186), Online publication date: 1-Oct-2017.
  99. Bitansky N, Canetti R, Chiesa A, Goldwasser S, Lin H, Rubinstein A and Tromer E (2017). The Hunting of the SNARK, Journal of Cryptology, 30:4, (989-1066), Online publication date: 1-Oct-2017.
  100. ACM
    Salinas S and Li P Secure Cloud Computing for Pairwise Sequence Alignment Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics, (178-183)
  101. ACM
    Kolman E and Pinkas B (2017). Securely Computing a Ground Speed Model, ACM Transactions on Intelligent Systems and Technology, 8:4, (1-13), Online publication date: 31-Jul-2017.
  102. Li J, Yu F, Deng G, Luo C, Ming Z and Yan Q (2017). Industrial Internet: A Survey on the Enabling Technologies, Applications, and Challenges, IEEE Communications Surveys & Tutorials, 19:3, (1504-1526), Online publication date: 1-Jul-2017.
  103. Gomez-Barrero M, Maiorana E, Galbally J, Campisi P and Fierrez J (2017). Multi-biometric template protection based on Homomorphic Encryption, Pattern Recognition, 67:C, (149-163), Online publication date: 1-Jul-2017.
  104. Kiltz E, O'neill A and Smith A (2017). Instantiability of RSA-OAEP Under Chosen-Plaintext Attack, Journal of Cryptology, 30:3, (889-919), Online publication date: 1-Jul-2017.
  105. Asharov G, Lindell Y, Schneider T and Zohner M (2017). More Efficient Oblivious Transfer Extensions, Journal of Cryptology, 30:3, (805-858), Online publication date: 1-Jul-2017.
  106. ACM
    Canetti R, Poburinnaya O and Venkitasubramaniam M Equivocating Yao Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, (497-509)
  107. Mao Y, Chen T, Zhang Y, Wang T and Zhong S (2017). Towards Privacy-Preserving Aggregation for Collaborative Spectrum Sensing, IEEE Transactions on Information Forensics and Security, 12:6, (1483-1493), Online publication date: 1-Jun-2017.
  108. Dani V, King V, Movahedi M, Saia J and Zamani M (2017). Secure multi-party computation in large networks, Distributed Computing, 30:3, (193-229), Online publication date: 1-Jun-2017.
  109. ACM
    Applebaum B, Avron J and Brzuska C (2017). Arithmetic Cryptography, Journal of the ACM, 64:2, (1-74), Online publication date: 30-Apr-2017.
  110. ACM
    Alanwar A, Shoukry Y, Chakraborty S, Martin P, Tabuada P and Srivastava M PrOLoc Proceedings of the 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, (41-52)
  111. ACM
    Mozaffari-Kermani M, Azarderakhsh R and Aghaie A (2016). Fault Detection Architectures for Post-Quantum Cryptographic Stateless Hash-Based Secure Signatures Benchmarked on ASIC, ACM Transactions on Embedded Computing Systems, 16:2, (1-19), Online publication date: 14-Apr-2017.
  112. ACM
    Rasheed A, Kenneth A, Mahapatra R and Puthal D Private matching and set intersection computation in multi-agent and industrial control systems Proceedings of the 12th Annual Conference on Cyber and Information Security Research, (1-6)
  113. Asharov G, Bonchi F, Garcia-Soriano D and Tassa T Secure Centrality Computation Over Multiple Networks Proceedings of the 26th International Conference on World Wide Web, (957-966)
  114. Benhamouda F, Herranz J, Joye M and Libert B (2017). Efficient Cryptosystems From $$\mathbf{2}^{{\varvec{k}}}$$2k-th Power Residue Symbols, Journal of Cryptology, 30:2, (519-549), Online publication date: 1-Apr-2017.
  115. Schröder D and Unruh D (2017). Security of Blind Signatures Revisited, Journal of Cryptology, 30:2, (470-494), Online publication date: 1-Apr-2017.
  116. ACM
    Ziegeldorf J, Metzke J, Rüth J, Henze M and Wehrle K Privacy-Preserving HMM Forward Computation Proceedings of the Seventh ACM on Conference on Data and Application Security and Privacy, (83-94)
  117. ACM
    Drosatos G, Tasidou A and Efraimidis P (2017). Privacy-Enhanced Television Audience Measurements, ACM Transactions on Internet Technology, 17:1, (1-29), Online publication date: 6-Mar-2017.
  118. Xu G, Amariucai G and Guan Y (2017). Delegation of Computation with Verification Outsourcing, IEEE Transactions on Parallel and Distributed Systems, 28:3, (717-730), Online publication date: 1-Mar-2017.
  119. Lechler T and Wetzel S (2017). Conceptualizing the silent risk of inadvertent information leakages, Computers and Electrical Engineering, 58:C, (67-75), Online publication date: 1-Feb-2017.
  120. Buchbinder N, Haitner I, Levi N and Tsfadia E Fair coin flipping Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (2580-2600)
  121. Choudhury A and Patra A (2017). An Efficient Framework for Unconditionally Secure Multiparty Computation, IEEE Transactions on Information Theory, 63:1, (428-468), Online publication date: 1-Jan-2017.
  122. Zhang Y, Chen Q and Zhong S (2017). Efficient and Privacy-Preserving Min and $k$ th Min Computations in Mobile Sensing Systems, IEEE Transactions on Dependable and Secure Computing, 14:1, (9-21), Online publication date: 1-Jan-2017.
  123. Dou Y, Zeng K, Li H, Yang Y, Gao B, Ren K and Li S (2017). $P^{2}$ -SAS, IEEE Journal on Selected Areas in Communications, 35:1, (173-187), Online publication date: 1-Jan-2017.
  124. Asharov G and Lindell Y (2017). A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation, Journal of Cryptology, 30:1, (58-151), Online publication date: 1-Jan-2017.
  125. ACM
    Agadakos I, Hallgren P, Damopoulos D, Sabelfeld A and Portokalidis G Location-enhanced authentication using the IoT Proceedings of the 32nd Annual Conference on Computer Security Applications, (251-264)
  126. Coretti S, Garay J, Hirt M and Zikas V Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions Proceedings, Part II, of the 22nd International Conference on Advances in Cryptology --- ASIACRYPT 2016 - Volume 10032, (998-1021)
  127. Li X, Zhu Y and Wang J Secure Naïve Bayesian Classification over Encrypted Data in Cloud Proceedings of the 10th International Conference on Provable Security - Volume 10005, (130-150)
  128. Gasti P, Sedenka J, Yang Q, Zhou G and Balagani K (2016). Secure, Fast, and Energy-Efficient Outsourced Authentication for Smartphones, IEEE Transactions on Information Forensics and Security, 11:11, (2556-2571), Online publication date: 1-Nov-2016.
  129. Cohen A and Klein S The GGM Function Family Is a Weakly One-Way Family of Functions Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985, (84-107)
  130. Bitansky N, Brakerski Z, Kalai Y, Paneth O and Vaikuntanathan V 3-Message Zero Knowledge Against Human Ignorance Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985, (57-83)
  131. Bun M, Chen Y and Vadhan S Separating Computational and Statistical Differential Privacy in the Client-Server Model Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985, (607-634)
  132. Hazay C and Yanai A Constant-Round Maliciously Secure Two-Party Computation in the RAM Model Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985, (521-553)
  133. ACM
    Kumaresan R and Bentov I Amortizing Secure Computation with Penalties Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, (418-429)
  134. ACM
    Kumaresan R, Vaikuntanathan V and Vasudevan P Improvements to Secure Computation with Penalties Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, (406-417)
  135. ACM
    Kolesnikov V, Kumaresan R, Rosulek M and Trieu N Efficient Batched Oblivious PRF with Applications to Private Set Intersection Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, (818-829)
  136. ACM
    Araki T, Furukawa J, Lindell Y, Nof A and Ohara K High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, (805-817)
  137. ACM
    Bost R ∑oφoς Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, (1143-1154)
  138. ACM
    Nanni M, Trasarti R, Monreale A, Grossi V and Pedreschi D (2016). Driving Profiles Computation and Monitoring for Car Insurance CRM, ACM Transactions on Intelligent Systems and Technology, 8:1, (1-26), Online publication date: 3-Oct-2016.
  139. Kiraz M and Uzunkol O (2016). Efficient and verifiable algorithms for secure outsourcing of cryptographic computations, International Journal of Information Security, 15:5, (519-537), Online publication date: 1-Oct-2016.
  140. Asharov G, Canetti R and Hazay C (2016). Toward a Game Theoretic View of Secure Computation, Journal of Cryptology, 29:4, (879-926), Online publication date: 1-Oct-2016.
  141. Carter H, Mood B, Traynor P and Butler K (2016). Outsourcing secure two-party computation as a black box, Security and Communication Networks, 9:14, (2261-2275), Online publication date: 25-Sep-2016.
  142. Mano T, Inoue T, Ikarashi D, Hamada K, Mizutani K and Akashi O (2016). Efficient Virtual Network Optimization Across Multiple Domains Without Revealing Private Information, IEEE Transactions on Network and Service Management, 13:3, (477-488), Online publication date: 1-Sep-2016.
  143. Samanthula B and Jiang W (2016). Secure Multiset Intersection Cardinality and its Application to Jaccard Coefficient, IEEE Transactions on Dependable and Secure Computing, 13:5, (591-604), Online publication date: 1-Sep-2016.
  144. Hemenway B, Lu S, Ostrovsky R and Welser Iv W High-Precision Secure Computation of Satellite Collision Probabilities Proceedings of the 10th International Conference on Security and Cryptography for Networks - Volume 9841, (169-187)
  145. Bradley T, Faber S and Tsudik G Bounded Size-Hiding Private Set Intersection Proceedings of the 10th International Conference on Security and Cryptography for Networks - Volume 9841, (449-467)
  146. Ghosh E, Goodrich M, Ohrimenko O and Tamassia R Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees Proceedings of the 10th International Conference on Security and Cryptography for Networks - Volume 9841, (216-236)
  147. Gagliardoni T, Hülsing A and Schaffner C Semantic Security and Indistinguishability in the Quantum World Proceedings, Part III, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9816, (60-89)
  148. Döttling N, Fleischhacker N, Krupp J and Schröder D Two-Message, Oblivious Evaluation of Cryptographic Functionalities Proceedings, Part III, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9816, (619-648)
  149. Ishai Y, Kushilevitz E, Prabhakaran M, Sahai A and Yu C Secure Protocol Transformations Proceedings, Part II, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9815, (430-458)
  150. Bhuiyan M and Hasan M (2016). Interactive knowledge discovery from hidden data through sampling of frequent patterns, Statistical Analysis and Data Mining, 9:4, (205-229), Online publication date: 1-Aug-2016.
  151. Debnath S and Dutta R (2016). Towards fair mutual private set intersection with linear complexity, Security and Communication Networks, 9:11, (1589-1612), Online publication date: 25-Jul-2016.
  152. ACM
    Dou Y, Zeng K, Li H, Yang Y, Gao B, Guan C, Ren K and Li S P2-SAS Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, (321-330)
  153. Xu R, Morozov K, Yang Y, Zhou J and Takagi T Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database Proceedings, Part I, of the 21st Australasian Conference on Information Security and Privacy - Volume 9722, (181-197)
  154. Moran T, Naor M and Segev G (2016). An Optimally Fair Coin Toss, Journal of Cryptology, 29:3, (491-513), Online publication date: 1-Jul-2016.
  155. ACM
    Berndt S and Liśkiewicz M Provable Secure Universal Steganography of Optimal Rate Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security, (81-92)
  156. ACM
    Qiu S, Wang B, Li M, Victors J, Liu J, Shi Y and Wang W Fast, Private and Verifiable Proceedings of the 4th ACM International Workshop on Security in Cloud Computing, (29-36)
  157. ACM
    Zhang B, Zhang H, Yan B and Zhang Y A New Secure Index Supporting Efficient Index Updating and Similarity Search on Clouds Proceedings of the 4th ACM International Workshop on Security in Cloud Computing, (37-43)
  158. ACM
    Mao Y and Zhang Y Privacy Preserving Distributed Permutation Test Proceedings of the 4th ACM International Workshop on Security in Cloud Computing, (67-73)
  159. ACM
    Kim S, Kim J, Koo D, Kim Y, Yoon H and Shin J Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, (617-628)
  160. Garg S, Mukherjee P, Pandey O and Polychroniadou A The Exact Round Complexity of Secure Computation Proceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 9666, (448-476)
  161. Kocabas O, Soyata T and Aktas M (2016). Emerging security mechanisms for medical cyber physical systems, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 13:3, (401-416), Online publication date: 1-May-2016.
  162. Lindell Y (2016). Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries, Journal of Cryptology, 29:2, (456-490), Online publication date: 1-Apr-2016.
  163. Gennaro R, Hazay C and Sorensen J (2016). Automata Evaluation and Text Search Protocols with Simulation-Based Security, Journal of Cryptology, 29:2, (243-282), Online publication date: 1-Apr-2016.
  164. Cohen R Asynchronous Secure Multiparty Computation in Constant Time Proceedings, Part II, of the 19th IACR International Conference on Public-Key Cryptography --- PKC 2016 - Volume 9615, (183-207)
  165. Brandão L Very-Efficient Simulatable Flipping of Many Coins into a Well Proceedings, Part II, of the 19th IACR International Conference on Public-Key Cryptography --- PKC 2016 - Volume 9615, (297-326)
  166. Sun J, Zhang R, Jin X and Zhang Y (2016). SecureFind: Secure and Privacy-Preserving Object Finding via Mobile Crowdsourcing, IEEE Transactions on Wireless Communications, 15:3, (1716-1728), Online publication date: 1-Mar-2016.
  167. ACM
    Halevi S, Ishai Y, Jain A, Kushilevitz E and Rabin T Secure Multiparty Computation with General Interaction Patterns Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, (157-168)
  168. Bun M and Zhandry M Order-Revealing Encryption and the Hardness of Private Learning Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562, (176-206)
  169. Cohen R, Haitner I, Omri E and Rotem L Characterization of Secure Multiparty Computation Without Broadcast Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562, (596-616)
  170. Yuan Zhang , He Zhang , Siyuan Tang and Sheng Zhong (2016). Designing Secure and Dependable Mobile Sensing Mechanisms With Revenue Guarantees, IEEE Transactions on Information Forensics and Security, 11:1, (100-113), Online publication date: 1-Jan-2016.
  171. Goto S and Shikata J A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer Proceedings of the 15th IMA International Conference on Cryptography and Coding - Volume 9496, (133-151)
  172. Kiraz M, Genc Z and Kardas S (2015). Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer, Security and Communication Networks, 8:18, (4123-4135), Online publication date: 1-Dec-2015.
  173. Rass S, Schartner P and Brodbeck M (2015). Private function evaluation by local two-party computation, EURASIP Journal on Information Security, 2015:1, (1-11), Online publication date: 1-Dec-2015.
  174. Debnath S and Dutta R Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries Proceedings of the 9th International Conference on Provable Security - Volume 9451, (326-339)
  175. Hallgren P, Ochoa M and Sabelfeld A BetterTimes Proceedings of the 9th International Conference on Provable Security - Volume 9451, (291-309)
  176. ACM
    Mao Y, Chen T, Zhang Y, Wang T and Zhong S Protecting Location Information in Collaborative Sensing of Cognitive Radio Networks Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, (219-226)
  177. ACM
    Shafagh H, Hithnawi A, Droescher A, Duquennoy S and Hu W Talos Proceedings of the 13th ACM Conference on Embedded Networked Sensor Systems, (197-210)
  178. ACM
    Cock M, Dowsley R, Nascimento A and Newman S Fast, Privacy Preserving Linear Regression over Distributed Datasets based on Pre-Distributed Data Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security, (3-14)
  179. ACM
    Kumaresan R, Moran T and Bentov I How to Use Bitcoin to Play Decentralized Poker Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, (195-206)
  180. ACM
    Liu J, Asokan N and Pinkas B Secure Deduplication of Encrypted Data without Additional Independent Servers Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, (874-885)
  181. ACM
    Riliskis L, Shafagh H and Levis P POSTER Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, (1668-1670)
  182. ACM
    Gasti P and Rasmussen K Privacy-preserving User Matching Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society, (111-120)
  183. Hoffman C, Cortes M, Aranha D and Araujo G Computer security by hardware-intrinsic authentication Proceedings of the 10th International Conference on Hardware/Software Codesign and System Synthesis, (143-152)
  184. Cachin C, Crépeau C, Marcil J and Savvides G (2015). Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver, IEEE Transactions on Information Theory, 61:10, (5623-5635), Online publication date: 1-Oct-2015.
  185. Sun Y and Wen Q (2015). A general two-party bi-input private function evaluation protocol, Security and Communication Networks, 8:15, (2536-2544), Online publication date: 1-Oct-2015.
  186. Yuan Hong , Vaidya J, Haibing Lu , Karras P and Goel S (2015). Collaborative Search Log Sanitization: Toward Differential Privacy and Boosted Utility, IEEE Transactions on Dependable and Secure Computing, 12:5, (504-518), Online publication date: 1-Sep-2015.
  187. Deng Y and Zhang Y (2015). Program equivalence in linear contexts, Theoretical Computer Science, 585:C, (71-90), Online publication date: 20-Jun-2015.
  188. Chen F, Bezawada B and Liu A (2015). Privacy-preserving quantification of cross-domain network reachability, IEEE/ACM Transactions on Networking, 23:3, (946-958), Online publication date: 1-Jun-2015.
  189. Samanthula B, Elmehdwi Y and Wei Jiang (2015). k-Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data, IEEE Transactions on Knowledge and Data Engineering, 27:5, (1261-1273), Online publication date: 1-May-2015.
  190. ACM
    Dolev S, Gilboa N and Li X Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party Computation Proceedings of the 3rd International Workshop on Security in Cloud Computing, (21-29)
  191. ACM
    Ateniese G, Dagdelen Ö, Damgård I and Venturi D Entangled Encodings and Data Entanglement Proceedings of the 3rd International Workshop on Security in Cloud Computing, (3-12)
  192. ACM
    Kerschbaum F Oblivious outsourcing of garbled circuit generation Proceedings of the 30th Annual ACM Symposium on Applied Computing, (2134-2140)
  193. Tadaki K and Doi N (2015). Cryptography and Algorithmic Randomness, Theory of Computing Systems, 56:3, (544-580), Online publication date: 1-Apr-2015.
  194. ACM
    Hayawi K, Mortezaei A and Tripunitara M The Limits of the Trade-Off Between Query-Anonymity and Communication-Cost in Wireless Sensor Networks Proceedings of the 5th ACM Conference on Data and Application Security and Privacy, (337-348)
  195. Haitner I, Hoch J, Reingold O and Segev G (2015). Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, SIAM Journal on Computing, 44:1, (193-242), Online publication date: 5-Feb-2015.
  196. Sedenka J, Govindarajan S, Gasti P and Balagani K (2015). Secure Outsourced Biometric Authentication With Performance Evaluation on Smartphones, IEEE Transactions on Information Forensics and Security, 10:2, (384-396), Online publication date: 1-Feb-2015.
  197. ACM
    Bösch C, Hartel P, Jonker W and Peter A (2014). A Survey of Provably Secure Searchable Encryption, ACM Computing Surveys, 47:2, (1-51), Online publication date: 8-Jan-2015.
  198. ACM
    Papadopoulos S, Cormode G, Deligiannakis A and Garofalakis M (2014). Lightweight Query Authentication on Streams, ACM Transactions on Database Systems, 39:4, (1-45), Online publication date: 30-Dec-2015.
  199. Zhu Y, Li D and Yang L Traitor Tracing Based on Partially-Ordered Hierarchical Encryption Revised Selected Papers of the 6th International Conference on Trusted Systems - Volume 9473, (278-293)
  200. Jiang S (2014). Timed encryption with application to deniable key exchange, Theoretical Computer Science, 560:P2, (172-189), Online publication date: 4-Dec-2014.
  201. Shi W (2014). A provable secure sealed-bid multi-attribute auction scheme under semi-honest model, International Journal of Communication Systems, 27:12, (3738-3747), Online publication date: 1-Dec-2014.
  202. ACM
    Bothe S, Cuzzocrea A, Karras P and Vlachou A Skyline Query Processing over Encrypted Data Proceedings of the First International Workshop on Privacy and Secuirty of Big Data, (37-43)
  203. ACM
    Chase M, Meiklejohn S and Zaverucha G Algebraic MACs and Keyed-Verification Anonymous Credentials Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, (1205-1216)
  204. Qin J, Duan H, Zhao H and Hu J (2014). A new Lagrange solution to the privacy-preserving general geometric intersection problem, Journal of Network and Computer Applications, 46:C, (94-99), Online publication date: 1-Nov-2014.
  205. Xue H, Li B, Lu X, Wang K and Liu Y On the Lossiness of 2k-th Power and the Instantiability of Rabin-OAEP Proceedings of the 13th International Conference on Cryptology and Network Security - Volume 8813, (34-49)
  206. Wong K and Kim M (2014). On private Hamming distance computation, The Journal of Supercomputing, 69:3, (1123-1138), Online publication date: 1-Sep-2014.
  207. Pinkas B, Schneider T and Zohner M Faster private set intersection based on OT extension Proceedings of the 23rd USENIX conference on Security Symposium, (797-812)
  208. Moataz T, Justus B, Ray I, Cuppens-Boulahia N, Cuppens F and Ray I Privacy-Preserving Multiple Keyword Search on Outsourced Data in the Clouds Proceedings of the 28th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy XXVIII - Volume 8566, (66-81)
  209. Hong Y, Vaidya J, Lu H and Wang L Collaboratively Solving the Traveling Salesman Problem with Limited Disclosure Proceedings of the 28th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy XXVIII - Volume 8566, (179-194)
  210. ACM
    Šeděnka J and Gasti P Privacy-preserving distance computation and proximity testing on earth, done right Proceedings of the 9th ACM symposium on Information, computer and communications security, (99-110)
  211. ACM
    Genkin D, Ishai Y, Prabhakaran M, Sahai A and Tromer E Circuits resilient to additive attacks with applications to secure computation Proceedings of the forty-sixth annual ACM symposium on Theory of computing, (495-504)
  212. ACM
    Haitner I and Tsfadia E An almost-optimally fair three-party coin-flipping protocol Proceedings of the forty-sixth annual ACM symposium on Theory of computing, (408-416)
  213. Zhang B and Zhang F (2014). Secure similarity coefficients computation for binary data and its extensions, Concurrency and Computation: Practice & Experience, 26:5, (1023-1037), Online publication date: 10-Apr-2014.
  214. Launchbury J, Archer D, Dubuisson T and Mertens E Application-Scale Secure Multiparty Computation Proceedings of the 23rd European Symposium on Programming Languages and Systems - Volume 8410, (8-26)
  215. Hazay C and Toft T (2014). Computationally Secure Pattern Matching in the Presence of Malicious Adversaries, Journal of Cryptology, 27:2, (358-395), Online publication date: 1-Apr-2014.
  216. Brakerski Z and Segev G (2014). Better Security for Deterministic Public-Key Encryption, Journal of Cryptology, 27:2, (210-247), Online publication date: 1-Apr-2014.
  217. Armknecht F, Gagliardoni T, Katzenbeisser S and Peter A General Impossibility of Group Homomorphic Encryption in the Quantum World Proceedings of the 17th International Conference on Public-Key Cryptography --- PKC 2014 - Volume 8383, (556-573)
  218. ACM
    Wen Z and Dong C Efficient protocols for private record linkage Proceedings of the 29th Annual ACM Symposium on Applied Computing, (1688-1694)
  219. ACM
    Ghinita G and Rughinis R An efficient privacy-preserving system for monitoring mobile users Proceedings of the 4th ACM conference on Data and application security and privacy, (321-332)
  220. ACM
    Tarameshloo E, Fong P and Mohassel P On protection in federated social computing systems Proceedings of the 4th ACM conference on Data and application security and privacy, (75-86)
  221. Clifton C and Anandan B Challenges and Opportunities for Security with Differential Privacy Proceedings of the 9th International Conference on Information Systems Security - Volume 8303, (1-13)
  222. ACM
    Husted N, Myers S, Shelat A and Grubbs P GPU and CPU parallelization of honest-but-curious secure two-party computation Proceedings of the 29th Annual Computer Security Applications Conference, (169-178)
  223. Liu J, Xiong L and Luo J (2013). Semantic Security, Transactions on Data Privacy, 6:3, (185-198), Online publication date: 1-Dec-2013.
  224. Fukushima M, Sugiyama K, Hasegawa T, Hasegawa T and Nakao A (2013). Minimum disclosure routing for network virtualization and its experimental evaluation, IEEE/ACM Transactions on Networking, 21:6, (1839-1851), Online publication date: 1-Dec-2013.
  225. Baecher P, Brzuska C and Fischlin M Notions of Black-Box Reductions, Revisited Part I of the Proceedings of the 19th International Conference on Advances in Cryptology - ASIACRYPT 2013 - Volume 8269, (296-315)
  226. D’Arco P and De Prisco R Secure Two-Party Computation: A Visual Way Information Theoretic Security, (18-38)
  227. ACM
    Ghinita G and Rughinis R A privacy-preserving location-based alert system Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (432-435)
  228. ACM
    Urmoneit R and Kerschbaum F Efficient secure computation optimization Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies, (11-18)
  229. ACM
    Kerschbaum F, Lim H and Gudymenko I Privacy-preserving billing for e-ticketing systems in public transportation Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society, (143-154)
  230. ACM
    Asharov G, Lindell Y, Schneider T and Zohner M More efficient oblivious transfer and extensions for faster secure computation Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, (535-548)
  231. ACM
    Akinyele J, Green M and Hohenberger S Using SMT solvers to automate design tasks for encryption and signature schemes Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, (399-410)
  232. ACM
    Dong C, Chen L and Wen Z When private set intersection meets big data Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, (789-800)
  233. ACM
    shelat a and Shen C Fast two-party secure computation with minimal assumptions Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, (523-534)
  234. ACM
    Jawurek M, Kerschbaum F and Orlandi C Zero-knowledge using garbled circuits Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, (955-966)
  235. ACM
    Braun B, Feldman A, Ren Z, Setty S, Blumberg A and Walfish M Verifying computations with state Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, (341-357)
  236. ACM
    Lyubashevsky V, Peikert C and Regev O (2013). On Ideal Lattices and Learning with Errors over Rings, Journal of the ACM, 60:6, (1-35), Online publication date: 1-Nov-2013.
  237. Neugebauer G, Brutschy L, Meyer U and Wetzel S Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model Revised Selected Papers of the 8th International Workshop on Data Privacy Management and Autonomous Spontaneous Security - Volume 8247, (178-193)
  238. Chen Q, Hu H and Xu J (2013). Authenticating top-k queries in location-based services with confidentiality, Proceedings of the VLDB Endowment, 7:1, (49-60), Online publication date: 1-Sep-2013.
  239. ACM
    Hoens T, Blanton M, Steele A and Chawla N (2013). Reliable medical recommendation systems with patient privacy, ACM Transactions on Intelligent Systems and Technology, 4:4, (1-31), Online publication date: 1-Sep-2013.
  240. ACM
    Xu G, Amariucai G and Guan Y Delegation of computation with verification outsourcing Proceedings of the 2013 ACM symposium on Principles of distributed computing, (393-402)
  241. Dong C, Chen L, Camenisch J and Russello G Fair Private Set Intersection with a Semi-trusted Arbiter Proceedings of the 27th Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy XXVII - Volume 7964, (128-144)
  242. Groat M, Edwards B, Horey J, He W and Forrest S (2013). Application and analysis of multidimensional negative surveys in participatory sensing applications, Pervasive and Mobile Computing, 9:3, (372-391), Online publication date: 1-Jun-2013.
  243. ACM
    Zhu Y, Xu R and Takagi T Secure k-NN computation on encrypted cloud data without sharing key with query users Proceedings of the 2013 international workshop on Security in cloud computing, (55-60)
  244. ACM
    Samanthula B, Chun H and Jiang W An efficient and probabilistic secure bit-decomposition Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, (541-546)
  245. ACM
    Moataz T and Shikfa A Boolean symmetric searchable encryption Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, (265-276)
  246. ACM
    Xu J, Chang E and Zhou J Weak leakage-resilient client-side deduplication of encrypted data in cloud storage Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, (195-206)
  247. Liu J, Xiong L, Luo J and Huang J (2013). Privacy Preserving Distributed DBSCAN Clustering, Transactions on Data Privacy, 6:1, (69-85), Online publication date: 1-Apr-2013.
  248. ACM
    Goryczka S, Xiong L and Sunderam V Secure multiparty aggregation with differential privacy Proceedings of the Joint EDBT/ICDT 2013 Workshops, (155-163)
  249. ACM
    Liu J, Xiong L and Luo J A privacy framework Proceedings of the Joint EDBT/ICDT 2013 Workshops, (131-136)
  250. Rothblum R On the circular security of bit-encryption Proceedings of the 10th theory of cryptography conference on Theory of Cryptography, (579-598)
  251. Lindell Y and Zarosim H On the feasibility of extending oblivious transfer Proceedings of the 10th theory of cryptography conference on Theory of Cryptography, (519-538)
  252. Asharov G, Lindell Y and Rabin T A full characterization of functions that imply fair coin tossing and ramifications to fairness Proceedings of the 10th theory of cryptography conference on Theory of Cryptography, (243-262)
  253. ACM
    Chaki S, Schallhart C and Veith H (2013). Verification across Intellectual Property Boundaries, ACM Transactions on Software Engineering and Methodology, 22:2, (1-12), Online publication date: 1-Mar-2013.
  254. ACM
    Kerschbaum F Expression rewriting for optimizing secure computation Proceedings of the third ACM conference on Data and application security and privacy, (49-58)
  255. ACM
    Panjwani S Practical receipt authentication for branchless banking Proceedings of the 3rd ACM Symposium on Computing for Development, (1-10)
  256. ACM
    Chung K, Lin H, Mahmoody M and Pass R On the power of nonuniformity in proofs of security Proceedings of the 4th conference on Innovations in Theoretical Computer Science, (389-400)
  257. Vatsalan D and Christen P An iterative two-party protocol for scalable privacy-preserving record linkage Proceedings of the Tenth Australasian Data Mining Conference - Volume 134, (127-138)
  258. Lindell Y, Omri E and Zarosim H Completeness for symmetric two-party functionalities - revisited Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security, (116-133)
  259. Asharov G and Orlandi C Calling out cheaters Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security, (681-698)
  260. Kakvi S, Kiltz E and May A Certifying RSA Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security, (404-414)
  261. Bellare M, Hoang V and Rogaway P Adaptively secure garbling with applications to one-time programs and secure outsourcing Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security, (134-153)
  262. Kim M, Mohaisen A, Cheon J and Kim Y Private over-threshold aggregation protocols Proceedings of the 15th international conference on Information Security and Cryptology, (472-486)
  263. Hamada K, Kikuchi R, Ikarashi D, Chida K and Takahashi K Practically efficient multi-party sorting protocols from comparison sort algorithms Proceedings of the 15th international conference on Information Security and Cryptology, (202-216)
  264. ACM
    Bhuiyan M, Mukhopadhyay S and Hasan M Interactive pattern mining on hidden data Proceedings of the 21st ACM international conference on Information and knowledge management, (95-104)
  265. Yang W, Jia B and Cao B Study of a fuzzy comprehensive evaluation problem in cloud computing Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence, (120-125)
  266. ACM
    Fletcher C, Dijk M and Devadas S Towards an interpreter for efficient encrypted computation Proceedings of the 2012 ACM Workshop on Cloud computing security workshop, (83-94)
  267. ACM
    Kamara S, Mohassel P and Riva B Salus Proceedings of the 2012 ACM conference on Computer and communications security, (797-808)
  268. ACM
    Launchbury J, Diatchki I, DuBuisson T and Adams-Moran A (2012). Efficient lookup-table protocol in secure multiparty computation, ACM SIGPLAN Notices, 47:9, (189-200), Online publication date: 15-Oct-2012.
  269. ACM
    De Cristofaro E, Faber S, Gasti P and Tsudik G Genodroid Proceedings of the 2012 ACM workshop on Privacy in the electronic society, (97-108)
  270. Kerschbaum F Privacy-Preserving Computation Revised Selected Papers of the First Annual Privacy Forum on Privacy Technologies and Policy - Volume 8319, (41-54)
  271. Ateniese G, Baldoni R, Bonomi S and Di Luna G Oblivious assignment with m slots Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems, (187-201)
  272. Goodrich M, Ohrimenko O and Tamassia R Graph drawing in the cloud Proceedings of the 20th international conference on Graph Drawing, (43-54)
  273. ACM
    Launchbury J, Diatchki I, DuBuisson T and Adams-Moran A Efficient lookup-table protocol in secure multiparty computation Proceedings of the 17th ACM SIGPLAN international conference on Functional programming, (189-200)
  274. ACM
    Erkin Z, Beye M, Veugen T and Lagendijk R Privacy-preserving content-based recommender system Proceedings of the on Multimedia and security, (77-84)
  275. Desmedt Y, Pieprzyk J and Steinfeld R Active security in multiparty computation over black-box groups Proceedings of the 8th international conference on Security and Cryptography for Networks, (503-521)
  276. Yu C and Yang B Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation Proceedings of the 8th international conference on Security and Cryptography for Networks, (426-444)
  277. Canetti R and Vald M Universally composable security with local adversaries Proceedings of the 8th international conference on Security and Cryptography for Networks, (281-301)
  278. Siad A A new approach for private searches on public-key encrypted data Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security, (160-173)
  279. Samet S and Miri A (2012). Privacy-preserving back-propagation and extreme learning machine algorithms, Data & Knowledge Engineering, 79-80, (40-61), Online publication date: 1-Sep-2012.
  280. Alwen J, Katz J, Maurer U and Zikas V Collusion-Preserving Computation Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 7417, (124-143)
  281. Nielsen J, Nordholt P, Orlandi C and Burra S A New Approach to Practical Active-Secure Two-Party Computation Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 7417, (681-700)
  282. Chase M and Visconti I Secure Database Commitments and Universal Arguments of Quasi Knowledge Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 7417, (236-254)
  283. Chan T, Li M, Shi E and Xu W Differentially private continual monitoring of heavy hitters from distributed streams Proceedings of the 12th international conference on Privacy Enhancing Technologies, (140-159)
  284. Takenouchi T, Kawamura T and Ohsuga A Distributed data federation without disclosure of user existence Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy, (282-297)
  285. D'Arco P, González Vasco M, Pérez del Pozo A and Soriente C Size-hiding in private set intersection Proceedings of the 5th international conference on Cryptology in Africa, (378-394)
  286. Gelles R, Ostrovsky R and Winoto K Multiparty proximity testing with dishonest majority from equality testing Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II, (537-548)
  287. Morozov K and Takagi T Zero-knowledge protocols for the mceliece encryption Proceedings of the 17th Australasian conference on Information Security and Privacy, (180-193)
  288. Elkhiyaoui K, Blass E and Molva R T-Match Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues, (76-95)
  289. ACM
    Dolev S and Kopeetsky M (2012). Anonymous transactions in computer networks, ACM Transactions on Autonomous and Adaptive Systems, 7:2, (1-14), Online publication date: 1-Jul-2012.
  290. Erkin Z and Tsudik G Private computation of spatial and temporal power consumption with smart meters Proceedings of the 10th international conference on Applied Cryptography and Network Security, (561-577)
  291. Ganesh C and Pandu Rangan C Optimal parameters for efficient two-party computation protocols Proceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems, (128-143)
  292. ACM
    Mardziel P, Hicks M, Katz J and Srivatsa M Knowledge-oriented secure multiparty computation Proceedings of the 7th Workshop on Programming Languages and Analysis for Security, (1-12)
  293. Yang B, Sato I and Nakagawa H Privacy-Preserving EM algorithm for clustering on social network Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I, (542-553)
  294. ACM
    Hu H, Xu J, Chen Q and Yang Z Authenticating location-based services without compromising location privacy Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, (301-312)
  295. Jagannathan G, Pillaipakkamnatt K and Wright R (2012). A Practical Differentially Private Random Decision Tree Classifier, Transactions on Data Privacy, 5:1, (273-295), Online publication date: 1-Apr-2012.
  296. ACM
    Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S and Yang K (2012). On the (im)possibility of obfuscating programs, Journal of the ACM, 59:2, (1-48), Online publication date: 1-Apr-2012.
  297. ACM
    Liu J, Huang J, Luo J and Xiong L Privacy preserving distributed DBSCAN clustering Proceedings of the 2012 Joint EDBT/ICDT Workshops, (177-185)
  298. ACM
    Ng W, Wen Y and Zhu H Private data deduplication protocols in cloud storage Proceedings of the 27th Annual ACM Symposium on Applied Computing, (441-446)
  299. ACM
    Kerschbaum F Collusion-resistant outsourcing of private set intersection Proceedings of the 27th Annual ACM Symposium on Applied Computing, (1451-1456)
  300. Damgård I, Faust S and Hazay C Secure two-party computation with low communication Proceedings of the 9th international conference on Theory of Cryptography, (54-74)
  301. Berman I and Haitner I From non-adaptive to adaptive pseudorandom functions Proceedings of the 9th international conference on Theory of Cryptography, (357-368)
  302. Katz J and Malka L Constant-Round private function evaluation with linear complexity Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security, (556-571)
  303. Bellare M, Cash D and Miller R Cryptography secure against related-key attacks and tampering Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security, (486-503)
  304. Grosskreutz H, Lemmen B and Rüuping S (2011). Secure Distributed Subgroup Discovery in Horizontally Partitioned Data, Transactions on Data Privacy, 4:3, (147-165), Online publication date: 1-Dec-2011.
  305. ACM
    Gordon S, Hazay C, Katz J and Lindell Y (2011). Complete Fairness in Secure Two-Party Computation, Journal of the ACM, 58:6, (1-37), Online publication date: 1-Dec-2011.
  306. Ioannou L and Mosca M A new spin on quantum cryptography Proceedings of the 4th international conference on Post-Quantum Cryptography, (255-274)
  307. ACM
    Kerschbaum F Automatically optimizing secure computation Proceedings of the 18th ACM conference on Computer and communications security, (703-714)
  308. ACM
    Baldi P, Baronio R, De Cristofaro E, Gasti P and Tsudik G Countering GATTACA Proceedings of the 18th ACM conference on Computer and communications security, (691-702)
  309. Baumslag G, Fazio N, Nicolosi A, Shpilrain V and Skeith W Generalized learning problems and applications to non-commutative cryptography Proceedings of the 5th international conference on Provable security, (324-339)
  310. Tonicelli R, David B and de Morais Alves V Universally composable private proximity testing Proceedings of the 5th international conference on Provable security, (222-239)
  311. Hermoni O, Gilboa N, Felstaine E, Elovici Y and Dolev S Rendezvous tunnel for anonymous publishing Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems, (223-237)
  312. ACM
    Franz M and Katzenbeisser S Processing encrypted floating point signals Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security, (103-108)
  313. Lancrenon J and Gillard R Isolating partial information of indistinguishable encryptions Proceedings of the 8th European conference on Public Key Infrastructures, Services, and Applications, (34-48)
  314. Arai H and Sakuma J Privacy preserving semi-supervised learning for labeled graphs Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I, (124-139)
  315. Arai H and Sakuma J Privacy preserving semi-supervised learning for labeled graphs Proceedings of the 2011th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I, (124-139)
  316. Kim M, Lee H and Cheon J Mutual private set intersection with linear complexity Proceedings of the 12th international conference on Information Security Applications, (219-231)
  317. Ishai Y, Kushilevitz E, Ostrovsky R, Prabhakaran M, Sahai A and Wullschleger J Constant-rate oblivious transfer from noisy channels Proceedings of the 31st annual conference on Advances in cryptology, (667-684)
  318. Brakerski Z and Segev G Better security for deterministic public-key encryption Proceedings of the 31st annual conference on Advances in cryptology, (543-560)
  319. Asharov G, Lindell Y and Rabin T Perfectly-secure multiplication for any t > n/3 Proceedings of the 31st annual conference on Advances in cryptology, (240-258)
  320. Halevi S, Lindell Y and Pinkas B Secure computation on the web Proceedings of the 31st annual conference on Advances in cryptology, (132-150)
  321. Huang Y, Evans D, Katz J and Malka L Faster secure two-party computation using garbled circuits Proceedings of the 20th USENIX conference on Security, (35-35)
  322. Kuzu M, Kantarcioglu M, Durham E and Malin B A constraint satisfaction cryptanalysis of bloom filters in private record linkage Proceedings of the 11th international conference on Privacy enhancing technologies, (226-245)
  323. Bilogrevic I, Jadliwala M, Kalkan K, Hubaux J and Aad I Privacy in mobile computing for location-sharing-based services Proceedings of the 11th international conference on Privacy enhancing technologies, (77-96)
  324. Jiang W and Samanthula B N-gram based secure similar document detection Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy, (239-246)
  325. Miyaji A and Rahman M Privacy-preserving data mining Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy, (186-200)
  326. Frikken K and Li B Private database search with sublinear query time Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy, (154-169)
  327. Barthe G, Crespo J and Kunz C Relational verification using product programs Proceedings of the 17th international conference on Formal methods, (200-214)
  328. Canetti R, Chari S, Halevi S, Pfitzmann B, Roy A, Steiner M and Venema W Composable security analysis of OS services Proceedings of the 9th international conference on Applied cryptography and network security, (431-448)
  329. ACM
    Lin H and Pass R Constant-round non-malleable commitments from any one-way function Proceedings of the forty-third annual ACM symposium on Theory of computing, (705-714)
  330. ACM
    Budinich M and Fortnow L Repeated matching pennies with limited randomness Proceedings of the 12th ACM conference on Electronic commerce, (111-118)
  331. Zhu H Non-black-box computation of linear regression protocols with malicious adversaries Proceedings of the 7th international conference on Information security practice and experience, (372-385)
  332. Zhu H Public-key encryptions tolerating adaptive and composable adversaries Proceedings of the 7th international conference on Information security practice and experience, (1-13)
  333. Ishai Y Correlation extractors and their applications Proceedings of the 5th international conference on Information theoretic security, (1-5)
  334. Applebaum B Key-dependent message security Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology, (527-546)
  335. Asharov G, Canetti R and Hazay C Towards a game theoretic view of secure computation Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology, (426-445)
  336. Ishai Y, Kushilevitz E, Ostrovsky R, Prabhakaran M and Sahai A Efficient non-interactive secure computation Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology, (406-425)
  337. Ullman J and Vadhan S PCPs and the hardness of generating private synthetic data Proceedings of the 8th conference on Theory of cryptography, (400-416)
  338. Lindell Y and Pinkas B Secure two-party computation via cut-and-choose oblivious transfer Proceedings of the 8th conference on Theory of cryptography, (329-346)
  339. Rothblum R Homomorphic encryption Proceedings of the 8th conference on Theory of cryptography, (219-234)
  340. Brakerski Z, Goldwasser S and Kalai Y Black-box circular-secure encryption beyond affine functions Proceedings of the 8th conference on Theory of cryptography, (201-218)
  341. ACM
    Morozov K and Savvides G Efficient computational oblivious transfer using interactive hashing Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, (448-452)
  342. ACM
    Minami K, Borisov N, Winslett M and Lee A Confidentiality-preserving proof theories for distributed proof systems Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, (145-154)
  343. Ateniese G, De Cristofaro E and Tsudik G (If) size matters Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography, (156-173)
  344. ACM
    Murugesan M, Jiang W, Nergiz A and Uzunbaz S k-out-of-n oblivious transfer based on homomorphic encryption and solvability of linear equations Proceedings of the first ACM conference on Data and application security and privacy, (169-178)
  345. ACM
    Mayer D, Teubert D, Wetzel S and Meyer U Implementation and performance evaluation of privacy-preserving fair reconciliation protocols on ordered sets Proceedings of the first ACM conference on Data and application security and privacy, (109-120)
  346. Emura K, Hanaoka G and Sakai Y Group signature implies PKE with non-interactive opening and threshold PKE Proceedings of the 5th international conference on Advances in information and computer security, (181-198)
  347. Klonowski M, Przykucki M, Strumiński T and Sulkowska M Practical universal random sampling Proceedings of the 5th international conference on Advances in information and computer security, (84-100)
  348. ACM
    Ghinita G, Vicente C, Shang N and Bertino E Privacy-preserving matching of spatial datasets with protection against background knowledge Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, (3-12)
  349. Zhan J (2010). Secure collaborative social networks, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 40:6, (682-689), Online publication date: 1-Nov-2010.
  350. Kreitz G, Dam M and Wikström D Practical private information aggregation in large networks Proceedings of the 15th Nordic conference on Information Security Technology for Applications, (89-103)
  351. Benali F, Bennani N, Gianini G and Cimato S A distributed and privacy-preserving method for network intrusion detection Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II, (861-875)
  352. ACM
    Katz J and Malka L Secure text processing with applications to private DNA matching Proceedings of the 17th ACM conference on Computer and communications security, (485-492)
  353. Grosskreutz H, Lemmen B and Rüping S Secure top-k subgroup discovery Proceedings of the international ECML/PKDD conference on Privacy and security issues in data mining and machine learning, (36-49)
  354. Hall R and Fienberg S Privacy-preserving record linkage Proceedings of the 2010 international conference on Privacy in statistical databases, (269-283)
  355. Roy A, Datta A, Derek A and Mitchell J (2010). Inductive trace properties for computational security, Journal of Computer Security, 18:6, (1035-1073), Online publication date: 21-Sep-2010.
  356. Chandran N, Ostrovsky R and Skeith W Public-key encryption with efficient amortized updates Proceedings of the 7th international conference on Security and cryptography for networks, (17-35)
  357. Winkler S and Wullschleger J On the efficiency of classical and quantum oblivious transfer reductions Proceedings of the 30th annual conference on Advances in cryptology, (707-723)
  358. Maji H, Prabhakaran M and Rosulek M A zero-one law for cryptographic complexity with respect to computational UC security Proceedings of the 30th annual conference on Advances in cryptology, (595-612)
  359. Ishai Y, Kushilevitz E and Paskin-Cherniavsky A Secure multiparty computation with minimal interaction Proceedings of the 30th annual conference on Advances in cryptology, (577-594)
  360. Beimel A, Omri E and Orlov I Protocols for multiparty coin toss with dishonest majority Proceedings of the 30th annual conference on Advances in cryptology, (538-557)
  361. Unruh D and Müller-Quade J Universally composable incoercibility Proceedings of the 30th annual conference on Advances in cryptology, (411-428)
  362. Wee H Efficient chosen-ciphertext security via extractable hash proofs Proceedings of the 30th annual conference on Advances in cryptology, (314-332)
  363. Gordon S, Wee H, Xiao D and Yerukhimovich A On the round complexity of zero-knowledge proofs based on one-way permutations Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America, (189-204)
  364. ACM
    Yang B, Nakagawa H, Sato I and Sakuma J Collusion-resistant privacy-preserving data mining Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, (483-492)
  365. ACM
    Lucas C, Raub D and Maurer U Hybrid-secure MPC Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (219-228)
  366. Applebaum B, Ringberg H, Freedman M, Caesar M and Rexford J Collaborative, privacy-preserving data aggregation at scale Proceedings of the 10th international conference on Privacy enhancing technologies, (56-74)
  367. Yao A, Yung M and Zhao Y Concurrent knowledge extraction in the public-key model Proceedings of the 37th international colloquium conference on Automata, languages and programming, (702-714)
  368. Huang Q and Wong D (2010). Generic certificateless encryption secure against malicious-hut-passive KGC attacks in the standard model, Journal of Computer Science and Technology, 25:4, (807-826), Online publication date: 1-Jul-2010.
  369. Franklin M and Mohassel P Efficient and secure evaluation of multivariate polynomials and applications Proceedings of the 8th international conference on Applied cryptography and network security, (236-254)
  370. Sakuma J and Arai H Online prediction with privacy Proceedings of the 27th International Conference on International Conference on Machine Learning, (935-942)
  371. Yang B and Nakagawa H Computation of ratios of secure summations in multi-party privacy-preserving latent dirichlet allocation Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I, (189-197)
  372. Upmanyu M, Namboodiri A, Srinathan K and Jawahar C Efficient privacy preserving k-means clustering Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics, (154-166)
  373. ACM
    Vaidya J, Atluri V, Shafiq B and Adam N Privacy-preserving trust verification Proceedings of the 15th ACM symposium on Access control models and technologies, (139-148)
  374. ACM
    Elmeleegy H, Ouzzani M, Elmagarmid A and Abusalah A Preserving privacy and fairness in peer-to-peer data integration Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, (759-770)
  375. Russello G, Dong C, Dulay N, Chaudron M and van Steen M (2010). Providing data confidentiality against malicious hosts in Shared Data Spaces, Science of Computer Programming, 75:6, (426-439), Online publication date: 1-Jun-2010.
  376. Gordon S and Katz J Partial fairness in secure two-party computation Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (157-176)
  377. Hada S Secure obfuscation for encrypted signatures Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (92-112)
  378. Fehr S, Hofheinz D, Kiltz E and Wee H Encryption schemes secure against chosen-ciphertext selective opening attacks Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (381-402)
  379. Micciancio D Computational soundness, co-induction, and encryption cycles Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (362-380)
  380. Lyubashevsky V, Peikert C and Regev O On ideal lattices and learning with errors over rings Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (1-23)
  381. ACM
    Wang G, Luo T, Goodrich M, Du W and Zhu Z Bureaucratic protocols for secure two-party sorting, selection, and permuting Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, (226-237)
  382. ACM
    Atallah M and Frikken K Securely outsourcing linear algebra computations Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, (48-59)
  383. Hamadou S and Mullins J (2010). Calibrating the power of schedulers for probabilistic polynomial-time calculus, Journal of Computer Security, 18:2, (265-316), Online publication date: 1-Apr-2010.
  384. Jagannathan G, Pillaipakkamnatt K, Wright R and Umano D (2010). Communication-Efficient Privacy-Preserving Clustering, Transactions on Data Privacy, 3:1, (1-25), Online publication date: 1-Apr-2010.
  385. ACM
    Cuzzocrea A and Bertino E A secure multiparty computation privacy preserving OLAP framework over distributed XML data Proceedings of the 2010 ACM Symposium on Applied Computing, (1666-1673)
  386. ACM
    Dolev S, Gilboa N and Kopeetsky M Computing multi-party trust privately Proceedings of the 2010 ACM Symposium on Applied Computing, (1460-1465)
  387. ACM
    Inan A, Kantarcioglu M, Ghinita G and Bertino E Private record matching using differential privacy Proceedings of the 13th International Conference on Extending Database Technology, (123-134)
  388. Gordon D, Ishai Y, Moran T, Ostrovsky R and Sahai A On complete primitives for fairness Proceedings of the 7th international conference on Theory of Cryptography, (91-108)
  389. Lyubashevsky V, Palacio A and Segev G Public-key cryptographic primitives provably as secure as subset sum Proceedings of the 7th international conference on Theory of Cryptography, (382-400)
  390. Goyal V, Ishai Y, Sahai A, Venkatesan R and Wadia A Founding cryptography on tamper-proof hardware tokens Proceedings of the 7th international conference on Theory of Cryptography, (308-326)
  391. Reyhanitabar M, Susilo W and Mu Y Enhanced security notions for dedicated-key hash functions Proceedings of the 17th international conference on Fast software encryption, (192-211)
  392. ACM
    Lysyanskaya A, Tamassia R and Triandopoulos N (2010). Authenticated error-correcting codes with applications to multicast authentication, ACM Transactions on Information and System Security, 13:2, (1-34), Online publication date: 1-Feb-2010.
  393. Frikken K Secure multiparty computation Algorithms and theory of computation handbook, (14-14)
  394. Stehlé D, Steinfeld R, Tanaka K and Xagawa K Efficient Public Key Encryption Based on Ideal Lattices Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (617-635)
  395. Choi S, Dachman-Soled D, Malkin T and Wee H Improved Non-committing Encryption with Applications to Adaptively Secure Protocols Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (287-302)
  396. Pinkas B, Schneider T, Smart N and Williams S Secure Two-Party Computation Is Practical Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (250-267)
  397. Zhong S (2009). On Distributed k-Anonymization, Fundamenta Informaticae, 92:4, (411-431), Online publication date: 1-Dec-2009.
  398. ACM
    Bowers K, Juels A and Oprea A Proofs of retrievability Proceedings of the 2009 ACM workshop on Cloud computing security, (43-54)
  399. Chmielewski Ł, Hoepman J and Rossum P Client-Server Password Recovery Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II, (861-878)
  400. ACM
    Zhang F and Zhao G A more well-founded security proof of the privacy-preserving distributed mining of association rules protocols Proceedings of the first international workshop on Model driven service engineering and data quality and security, (25-28)
  401. ACM
    Sang Y and Shen H (2009). Efficient and secure protocols for privacy-preserving set operations, ACM Transactions on Information and System Security, 13:1, (1-35), Online publication date: 1-Oct-2009.
  402. Pedersen T and Savaş E (2009). Impossibility of unconditionally secure scalar products, Data & Knowledge Engineering, 68:10, (1059-1070), Online publication date: 1-Oct-2009.
  403. Nojima R and Kadobayashi Y (2009). Cryptographically Secure Bloom-Filters, Transactions on Data Privacy, 2:2, (131-139), Online publication date: 1-Aug-2009.
  404. Yang Y, Bao F, Ding X and Deng R (2009). Multiuser private queries over encrypted databases, International Journal of Applied Cryptography, 1:4, (309-319), Online publication date: 1-Aug-2009.
  405. ACM
    Sakuma J and Kobayashi S Link analysis for private weighted graphs Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, (235-242)
  406. Wang I, Shen C, Zhan J, Hsu T, Liau C and Wang D (2009). Toward empirical aspects of secure scalar product, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 39:4, (440-447), Online publication date: 1-Jul-2009.
  407. Zhong S (2009). On Distributed k-Anonymization, Fundamenta Informaticae, 92:4, (411-431), Online publication date: 30-Jun-2009.
  408. ACM
    Dwork C, Naor M, Reingold O, Rothblum G and Vadhan S On the complexity of differentially private data release Proceedings of the forty-first annual ACM symposium on Theory of computing, (381-390)
  409. Lindell A Adaptively Secure Two-Party Computation with Erasures Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology, (117-132)
  410. Hofheinz D and Kiltz E Practical Chosen Ciphertext Secure Encryption from Factoring Proceedings of the 28th Annual International Conference on Advances in Cryptology - EUROCRYPT 2009 - Volume 5479, (313-332)
  411. Herzberg A (2009). Folklore, practice and theory of robust combiners, Journal of Computer Security, 17:2, (159-189), Online publication date: 1-Apr-2009.
  412. Fischlin M and Schröder D Security of Blind Signatures under Aborts Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09, (297-316)
  413. Ye J, Jiao X and Zhang Y Verifiable Threshold Secret Sharing and Full Fair Secure Two-Party Computation Proceedings of the 2009 International e-Conference on Advanced Science and Technology, (78-83)
  414. Ye Q, Wang H, Pieprzyk J and Zhang X (2009). Unconditionally secure disjointness tests for private datasets, International Journal of Applied Cryptography, 1:3, (225-235), Online publication date: 1-Feb-2009.
  415. ACM
    Atallah M, Blanton M, Fazio N and Frikken K (2009). Dynamic and Efficient Key Management for Access Hierarchies, ACM Transactions on Information and System Security, 12:3, (1-43), Online publication date: 1-Jan-2009.
  416. Sahai A Computing on Encrypted Data Proceedings of the 4th International Conference on Information Systems Security, (148-153)
  417. Backes M, Dürmuth M and Unruh D OAEP Is Secure under Key-Dependent Messages Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (506-523)
  418. Backes M and Unruh D Limits of Constructive Security Proofs Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (290-307)
  419. Yasuda K How to Fill Up Merkle-Damgård Hash Functions Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (272-289)
  420. Hirt M, Maurer U and Zikas V MPC vs. SFE Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (1-18)
  421. ACM
    Lin D, Bertino E, Cheng R and Prabhakar S Position transformation Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS, (62-71)
  422. ACM
    Hazay C and Lindell Y Constructions of truly practical secure protocols using standardsmartcards Proceedings of the 15th ACM conference on Computer and communications security, (491-500)
  423. ACM
    Ben-David A, Nisan N and Pinkas B FairplayMP Proceedings of the 15th ACM conference on Computer and communications security, (257-266)
  424. Ma Q and Deng P Secure Multi-party Protocols for Privacy Preserving Data Mining Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications, (526-537)
  425. ACM
    Yao D, Frikken K, Atallah M and Tamassia R (2008). Private Information, ACM Transactions on Information and System Security, 12:1, (1-27), Online publication date: 1-Oct-2008.
  426. Halpern J Beyond Nash equilibrium Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning, (6-14)
  427. ACM
    Halpern J Beyond nash equilibrium Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (1-10)
  428. Ishai Y, Prabhakaran M and Sahai A Founding Cryptography on Oblivious Transfer --- Efficiently Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology, (572-591)
  429. Lu H, He X, Vaidya J and Adam N Secure Construction of Contingency Tables from Distributed Data Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security, (144-157)
  430. Dong C, Russello G and Dulay N Shared and Searchable Encrypted Data for Untrusted Servers Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security, (127-143)
  431. Pietrzak K and Sjödin J Weak Pseudorandom Functions in Minicrypt Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (423-436)
  432. Ye Q, Wang H, Pieprzyk J and Zhang X Efficient Disjointness Tests for Private Datasets Proceedings of the 13th Australasian conference on Information Security and Privacy, (155-169)
  433. ACM
    Sakuma J, Kobayashi S and Wright R Privacy-preserving reinforcement learning Proceedings of the 25th international conference on Machine learning, (864-871)
  434. Blosser G and Zhan J Privacy-Preserving Collaborative E-Voting Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics, (508-513)
  435. Zhan J, Blosser G, Yang C and Singh L Privacy-Preserving Collaborative Social Networks Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics, (114-125)
  436. ACM
    Ghinita G, Kalnis P, Khoshgozaran A, Shahabi C and Tan K Private queries in location based services Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (121-132)
  437. Pavlovic D Network as a computer Proceedings of the 3rd international conference on Computer science: theory and applications, (384-397)
  438. Russello G, Dong C, Dulay N, Chaudron M and Van Steen M Encrypted shared data spaces Proceedings of the 10th international conference on Coordination models and languages, (264-279)
  439. Sakuma J and Kobayashi S Large-scale k-means clustering with user-centric privacy preservation Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining, (320-332)
  440. ACM
    Ishai Y, Kushilevitz E, Ostrovsky R and Sahai A Cryptography with constant computational overhead Proceedings of the fortieth annual ACM symposium on Theory of computing, (433-442)
  441. ACM
    Gordon D, Carmit H, Katz J and Lindell Y Complete fairness in secure two-party computation Proceedings of the fortieth annual ACM symposium on Theory of computing, (413-422)
  442. Bao F, Deng R, Ding X and Yang Y Private query on encrypted data in multi-user settings Proceedings of the 4th international conference on Information security practice and experience, (71-85)
  443. Chandran N, Goyal V and Sahai A New constructions for UC secure computation using tamper-proof hardware Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology, (545-562)
  444. Goyal V, Mohassel P and Smith A Efficient two party and multi party computation against covert adversaries Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology, (289-306)
  445. Lindell A Legally-enforceable fairness in secure two-party computation Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology, (121-137)
  446. Lindell A Efficient fully-simulatable oblivious transfer Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology, (52-70)
  447. Haitner I, Hoch J and Segev G A linear lower bound on the communication complexity of single-server private information retrieval Proceedings of the 5th conference on Theory of cryptography, (445-464)
  448. Haitner I Semi-honest to malicious oblivious transfer Proceedings of the 5th conference on Theory of cryptography, (412-426)
  449. Harnik D, Ishai Y, Kushilevitz E and Nielsen J OT-combiners via secure computation Proceedings of the 5th conference on Theory of cryptography, (393-411)
  450. Kol G and Naor M Cryptography and game theory Proceedings of the 5th conference on Theory of cryptography, (320-339)
  451. Abraham I, Dolev D and Halpern J Lower bounds on implementing robust and resilient mediators Proceedings of the 5th conference on Theory of cryptography, (302-319)
  452. Katz J Bridging game theory and cryptography Proceedings of the 5th conference on Theory of cryptography, (251-272)
  453. Hazay C and Lindell Y Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries Proceedings of the 5th conference on Theory of cryptography, (155-175)
  454. Herzberg A and Yoffe I The layered games framework for specifications and analysis of security protocols Proceedings of the 5th conference on Theory of cryptography, (125-141)
  455. ACM
    He X, Shafiq B, Vaidya J and Adam N Privacy-preserving link discovery Proceedings of the 2008 ACM symposium on Applied computing, (909-915)
  456. Canetti R, Cheung L, Kaynar D, Liskov M, Lynch N, Pereira O and Segala R (2008). Analyzing Security Protocols Using Time-Bounded Task-PIOAs, Discrete Event Dynamic Systems, 18:1, (111-159), Online publication date: 1-Mar-2008.
  457. Sang Y and Shen H Privacy preserving set intersection based on bilinear groups Proceedings of the thirty-first Australasian conference on Computer science - Volume 74, (47-54)
  458. Delporte-Gallet C, Fauconnier H, Guerraoui R and Ruppert E Secretive birds Proceedings of the 11th international conference on Principles of distributed systems, (329-342)
  459. Bringer J, Chabanne H, Pointcheval D and Tang Q Extended private information retrieval and its application in biometrics authentications Proceedings of the 6th international conference on Cryptology and network security, (175-193)
  460. Huang X, Mu Y, Susilo W and Wu W A generic construction for universally-convertible undeniable signatures Proceedings of the 6th international conference on Cryptology and network security, (15-33)
  461. Pass R, Shelat A and Vaikuntanathan V Relations among notions of non-malleability for encryption Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security, (519-535)
  462. Cramer R, Hanaoka G, Hofheinz D, Imai H, Kiltz E, Pass R, Shelat A and Vaikuntanathan V Bounded CCA2-secure encryption Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security, (502-518)
  463. Brassard G, Broadbent A, Fitzsimons J, Gambs S and Tapp A Anonymous quantum communication Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security, (460-473)
  464. Nam J, Paik J, Kim U and Won D (2007). Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks, Information Sciences: an International Journal, 177:23, (5441-5467), Online publication date: 1-Dec-2007.
  465. Huang Q and Wong D Generic certificateless encryption in the standard model Proceedings of the Security 2nd international conference on Advances in information and computer security, (278-291)
  466. Hada S and Sakurai K A note on the (Im)possibility of using obfuscators to transform private-key encryption into public-key encryption Proceedings of the Security 2nd international conference on Advances in information and computer security, (1-12)
  467. ACM
    Brickell J, Porter D, Shmatikov V and Witchel E Privacy-preserving remote diagnostics Proceedings of the 14th ACM conference on Computer and communications security, (498-507)
  468. ACM
    Bunn P and Ostrovsky R Secure two-party k-means clustering Proceedings of the 14th ACM conference on Computer and communications security, (486-497)
  469. Chan A and Castelluccia C On the privacy of concealed data aggregation Proceedings of the 12th European conference on Research in Computer Security, (390-405)
  470. Evdokimov S and Günther O Encryption techniques for secure database outsourcing Proceedings of the 12th European conference on Research in Computer Security, (327-342)
  471. Desmedt Y, Pieprzyk J, Steinfeld R and Wang H On secure multi-party computation in black-box groups Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (591-612)
  472. Prabhakaran M and Rosulek M Rerandomizable RCCA encryption Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (517-534)
  473. Harnik D, Ishai Y and Kushilevitz E How many oblivious transfers are needed for secure multiparty computation? Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (284-302)
  474. Horvitz O and Katz J Universally-composable two-party computation in two rounds Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (111-129)
  475. Applebaum B, Ishai Y and Kushilevitz E Cryptography with constant input locality Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (92-110)
  476. Yang Z, Zhong S and Wright R Towards privacy-preserving model selection Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD, (138-152)
  477. Dedic N and Mohassel P Constant-round private database queries Proceedings of the 34th international conference on Automata, Languages and Programming, (255-266)
  478. ACM
    Sakuma J and Kobayashi S A genetic algorithm for privacy preserving combinatorial optimization Proceedings of the 9th annual conference on Genetic and evolutionary computation, (1372-1379)
  479. Chaki S, Schallhart C and Veith H Verification across intellectual property boundaries Proceedings of the 19th international conference on Computer aided verification, (82-94)
  480. Dönigus D, Endler S, Fischlin M, Hülsing A, Jäger P, Lehmann A, Podrazhansky S, Schipp S, Tews E, Vowe S, Walthart M and Weidemann F Security of invertible media authentication schemes revisited Proceedings of the 9th international conference on Information hiding, (189-203)
  481. ACM
    Ishai Y, Kushilevitz E, Ostrovsky R and Sahai A Zero-knowledge from secure multiparty computation Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (21-30)
  482. ACM
    Katz J On achieving the "best of both worlds" in secure multiparty computation Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (11-20)
  483. Frikken K Privacy-Preserving Set Union Proceedings of the 5th international conference on Applied Cryptography and Network Security, (237-252)
  484. Huang Q, Wong D and Zhao Y Generic Transformation to Strongly Unforgeable Signatures Proceedings of the 5th international conference on Applied Cryptography and Network Security, (1-17)
  485. Gong G Randomness and representation of span n sequences Proceedings of the 2007 international conference on Sequences, subsequences, and consequences, (192-203)
  486. Mizuki T, Kugimoto Y and Sone H Secure multiparty computations using a dial lock Proceedings of the 4th international conference on Theory and applications of models of computation, (499-510)
  487. Woodruff D Revisiting the Efficiency of Malicious Two-Party Computation Proceedings of the 26th annual international conference on Advances in Cryptology, (79-96)
  488. Lindell Y and Pinkas B An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries Proceedings of the 26th annual international conference on Advances in Cryptology, (52-78)
  489. Camenisch J, Neven G and Shelat A Simulatable Adaptive Oblivious Transfer Proceedings of the 26th annual international conference on Advances in Cryptology, (573-590)
  490. Maurer U and Sjödin J A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security Proceedings of the 26th annual international conference on Advances in Cryptology, (498-516)
  491. Su C, Zhou J, Bao F, Takagi T and Sakurai K Two-party privacy-preserving agglomerative document clustering Proceedings of the 3rd international conference on Information security practice and experience, (193-208)
  492. Bellare M and Shoup S Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles Proceedings of the 10th international conference on Practice and theory in public-key cryptography, (201-216)
  493. Buldas A and Laur S Knowledge-binding commitments with applications in time-stamping Proceedings of the 10th international conference on Practice and theory in public-key cryptography, (150-165)
  494. Ishai Y and Paskin A Evaluating branching programs on encrypted data Proceedings of the 4th conference on Theory of cryptography, (575-594)
  495. Kiltz E, Mohassel P, Weinreb E and Franklin M Secure linear algebra using linearly recurrent sequences Proceedings of the 4th conference on Theory of cryptography, (291-310)
  496. Goldreich O On expected probabilistic polynomial-time adversaries Proceedings of the 4th conference on Theory of cryptography, (174-193)
  497. Backes M, Müler-Quade J and Unruh D On the necessity of rewinding in secure multiparty computation Proceedings of the 4th conference on Theory of cryptography, (157-173)
  498. Aumann Y and Lindell Y Security against covert adversaries Proceedings of the 4th conference on Theory of cryptography, (137-156)
  499. Müller-Quade J and Unruh D Long-term security and universal composability Proceedings of the 4th conference on Theory of cryptography, (41-60)
  500. Adelsbach A, Huber U and Sadeghi A Fingercasting-joint fingerprinting and decryption of broadcast messages Transactions on data hiding and multimedia security II, (1-34)
  501. Erkin Z, Piva A, Katzenbeisser S, Lagendijk R, Shokrollahi J, Neven G and Barni M (2007). Protection and retrieval of encrypted multimedia content, EURASIP Journal on Information Security, 2007, (1-20), Online publication date: 1-Jan-2007.
  502. Zhan J Using cryptography for privacy protection in data mining systems Proceedings of the 1st WICI international conference on Web intelligence meets brain informatics, (494-513)
  503. Pavan A, Santhanam R and Vinodchandran N Some results on average-case hardness within the polynomial hierarchy Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science, (188-199)
  504. ACM
    Rajsbaum S (2006). ACM SIGACT news distributed computing column 24, ACM SIGACT News, 37:4, (58-84), Online publication date: 1-Dec-2006.
  505. ACM
    Lindell Y, Lysyanskaya A and Rabin T (2006). On the composition of authenticated Byzantine Agreement, Journal of the ACM, 53:6, (881-917), Online publication date: 1-Nov-2006.
  506. ACM
    Kruger L, Jha S, Goh E and Boneh D Secure function evaluation with ordered binary decision diagrams Proceedings of the 13th ACM conference on Computer and communications security, (410-420)
  507. Hada S and Sakurai K Ciphertext-Auditable public key encryption Proceedings of the 1st international conference on Security, (308-321)
  508. Li J and Li N (2006). OACerts, IEEE Transactions on Dependable and Secure Computing, 3:4, (340-352), Online publication date: 1-Oct-2006.
  509. Frikken K, Atallah M and Li J (2006). Attribute-Based Access Control with Hidden Policies and Hidden Credentials, IEEE Transactions on Computers, 55:10, (1259-1270), Online publication date: 1-Oct-2006.
  510. Harnik D, Naor M, Reingold O and Rosen A (2006). Completeness in Two-Party Secure Computation, Journal of Cryptology, 19:4, (521-552), Online publication date: 1-Oct-2006.
  511. Gordon S and Katz J Rational secret sharing, revisited Proceedings of the 5th international conference on Security and Cryptography for Networks, (229-241)
  512. Nabar S, Marthi B, Kenthapadi K, Mishra N and Motwani R Towards robustness in query auditing Proceedings of the 32nd international conference on Very large data bases, (151-162)
  513. ACM
    Canetti R (2006). Security and composition of cryptographic protocols, ACM SIGACT News, 37:3, (67-92), Online publication date: 1-Sep-2006.
  514. Yang Z and Wright R (2006). Privacy-Preserving Computation of Bayesian Networks on Vertically Partitioned Data, IEEE Transactions on Knowledge and Data Engineering, 18:9, (1253-1264), Online publication date: 1-Sep-2006.
  515. ACM
    Laur S, Lipmaa H and Mielikäinen T Cryptographically private support vector machines Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, (618-624)
  516. ACM
    Brickell J and Shmatikov V Efficient anonymity-preserving data collection Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, (76-85)
  517. Meier R and Przydatek B On robust combiners for private information retrieval and other primitives Proceedings of the 26th annual international conference on Advances in Cryptology, (555-569)
  518. Ishai Y, Kushilevitz E, Lindell Y and Petrank E On combining privacy with guaranteed output delivery in secure multiparty computation Proceedings of the 26th annual international conference on Advances in Cryptology, (483-500)
  519. Pass R, shelat a and Vaikuntanathan V Construction of a non-malleable encryption scheme from any semantically secure one Proceedings of the 26th annual international conference on Advances in Cryptology, (271-289)
  520. Chaudhuri K and Mishra N When random sampling preserves privacy Proceedings of the 26th annual international conference on Advances in Cryptology, (198-213)
  521. Lysyanskaya A and Triandopoulos N Rationality and adversarial behavior in multi-party computation Proceedings of the 26th annual international conference on Advances in Cryptology, (180-197)
  522. Wang D, Liau C, Chiang Y and Hsu T Information Theoretical Analysis of Two-Party Secret Computation 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security on Data and Applications Security XX - Volume 4127, (310-317)
  523. ACM
    Abraham I, Dolev D, Gonen R and Halpern J Distributed computing meets game theory Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, (53-62)
  524. Bohli J, Vasco M and Steinwandt R A subliminal-free variant of ECDSA Proceedings of the 8th international conference on Information hiding, (375-387)
  525. ACM
    Feigenbaum J, Ishai Y, Malkin T, Nissim K, Strauss M and Wright R (2006). Secure multiparty computation of approximations, ACM Transactions on Algorithms, 2:3, (435-472), Online publication date: 1-Jul-2006.
  526. ACM
    Mishra N and Sandler M Privacy via pseudorandom sketches Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (143-152)
  527. Crépeau C, Savvides G, Schaffner C and Wullschleger J Information-Theoretic conditions for two-party secure function evaluation Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (538-554)
  528. Hofheinz D, Müller-Quade J and Unruh D On the (im-)possibility of extending coin toss Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (504-521)
  529. Dwork C, Kenthapadi K, McSherry F, Mironov I and Naor M Our data, ourselves Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (486-503)
  530. Ishai Y, Prabhakaran M, Sahai A and Wagner D Private circuits II Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (308-327)
  531. Wolf S and Wullschleger J Oblivious transfer is symmetric Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (222-232)
  532. ACM
    Kushilevitz E, Lindell Y and Rabin T Information-theoretically secure protocols and security under composition Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (109-118)
  533. ACM
    Ishai Y, Kushilevitz E, Lindell Y and Petrank E Black-box constructions for secure computation Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (99-108)
  534. Mizuki T, Otagiri T and Sone H Secure computations in a minimal model using multiple-valued ESOP expressions Proceedings of the Third international conference on Theory and Applications of Models of Computation, (547-554)
  535. Lysyanskaya A and Meyerovich M Provably secure steganography with imperfect sampling Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography, (123-139)
  536. Mohassel P and Franklin M Efficiency tradeoffs for malicious two-party computation Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography, (458-473)
  537. Abdalla M, Bresson E, Chevassut O and Pointcheval D Password-Based group key exchange in a constant number of rounds Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography, (427-442)
  538. Agrawal R and Terzi E On honesty in sovereign information sharing Proceedings of the 10th international conference on Advances in Database Technology, (240-256)
  539. Attrapadung N, Cui Y, Galindo D, Hanaoka G, Hasuo I, Imai H, Matsuura K, Yang P and Zhang R Relations among notions of security for identity based encryption schemes Proceedings of the 7th Latin American conference on Theoretical Informatics, (130-141)
  540. Nissim K and Weinreb E Communication efficient secure linear algebra Proceedings of the Third conference on Theory of Cryptography, (522-541)
  541. Dziembowski S Intrusion-Resilience via the bounded-storage model Proceedings of the Third conference on Theory of Cryptography, (207-224)
  542. Barak B, Lindell Y and Vadhan S (2006). Lower bounds for non-black-box zero knowledge, Journal of Computer and System Sciences, 72:2, (321-391), Online publication date: 1-Mar-2006.
  543. Atallah M, Blanton M, Frikken K and Li J Efficient correlated action selection Proceedings of the 10th international conference on Financial Cryptography and Data Security, (296-310)
  544. Rivest R, Shamir A and Tauman Y How to leak a secret Theoretical Computer Science, (164-186)
  545. Liu K, Kargupta H and Ryan J (2006). Random Projection-Based Multiplicative Data Perturbation for Privacy Preserving Distributed Data Mining, IEEE Transactions on Knowledge and Data Engineering, 18:1, (92-106), Online publication date: 1-Jan-2006.
  546. Yu Y, Leiwo J and Premkumar B An improved secure two-party computation protocol Proceedings of the First SKLOIS conference on Information Security and Cryptology, (221-232)
  547. Kolesnikov V Gate evaluation secret sharing and secure one-round two-party computation Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security, (136-155)
  548. Brickell J and Shmatikov V Privacy-Preserving graph algorithms in the semi-honest model Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security, (236-252)
  549. Jiang S and Gong G Efficient authenticators with application to key exchange Proceedings of the 8th international conference on Information Security and Cryptology, (81-91)
  550. ACM
    Gupta P and Shmatikov V Towards computationally sound symbolic analysis of key exchange protocols Proceedings of the 2005 ACM workshop on Formal methods in security engineering, (23-32)
  551. Jha S, Kruger L and McDaniel P Privacy preserving clustering Proceedings of the 10th European conference on Research in Computer Security, (397-417)
  552. Zhang N and Zhao W Distributed privacy preserving information sharing Proceedings of the 31st international conference on Very large data bases, (889-900)
  553. ACM
    Jagannathan G and Wright R Privacy-preserving distributed k-means clustering over arbitrarily partitioned data Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, (593-599)
  554. Pass R and shelat a Unconditional characterizations of non-interactive zero-knowledge Proceedings of the 25th annual international conference on Advances in Cryptology, (118-134)
  555. Barkol O and Ishai Y Secure computation of constant-depth circuits with applications to database search problems Proceedings of the 25th annual international conference on Advances in Cryptology, (395-411)
  556. Barak B, Canetti R, Lindell Y, Pass R and Rabin T Secure computation without authentication Proceedings of the 25th annual international conference on Advances in Cryptology, (361-377)
  557. Abdalla M, Bellare M, Catalano D, Kiltz E, Kohno T, Lange T, Malone-Lee J, Neven G, Paillier P and Shi H Searchable encryption revisited Proceedings of the 25th annual international conference on Advances in Cryptology, (205-222)
  558. Chiang Y, Wang D, Liau C and Hsu T Secrecy of two-party secure computation Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security, (114-123)
  559. Motro A and Parisi-Presicce F Blind custodians Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security, (338-352)
  560. ACM
    Zhong S, Yang Z and Wright R Privacy-enhancing k-anonymization of customer data Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (139-147)
  561. ACM
    Kalai Y, Lindell Y and Prabhakaran M Concurrent general composition of secure protocols in the timing model Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (644-653)
  562. ACM
    Lepinksi M, Micali S and shelat a Collusion-free protocols Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (543-552)
  563. Kalai Y Smooth projective hashing and two-message oblivious transfer Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (78-95)
  564. Haitner I, Horvitz O, Katz J, Koo C, Morselli R and Shaltiel R Reducing complexity assumptions for statistically-hiding commitment Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (58-77)
  565. Li N, Du W and Boneh D (2005). Oblivious signature-based envelope, Distributed Computing, 17:4, (293-302), Online publication date: 1-May-2005.
  566. Gentry C, Ramzan Z and Stubblebine S Secure distributed human computation Proceedings of the 9th international conference on Financial Cryptography and Data Security, (328-332)
  567. Frikken K and Atallah M Achieving fairness in private contract negotiation Proceedings of the 9th international conference on Financial Cryptography and Data Security, (270-284)
  568. Katz J and Lindell Y Handling expected polynomial-time strategies in simulation-based security proofs Proceedings of the Second international conference on Theory of Cryptography, (128-149)
  569. Nguyen M The relationship between password-authenticated key exchange and other cryptographic primitives Proceedings of the Second international conference on Theory of Cryptography, (457-475)
  570. Ishai Y, Kushilevitz E and Ostrovsky R Sufficient conditions for collision-resistant hashing Proceedings of the Second international conference on Theory of Cryptography, (445-456)
  571. Chawla S, Dwork C, McSherry F, Smith A and Wee H Toward privacy in public databases Proceedings of the Second international conference on Theory of Cryptography, (363-385)
  572. Boneh D, Goh E and Nissim K Evaluating 2-DNF formulas on ciphertexts Proceedings of the Second international conference on Theory of Cryptography, (325-341)
  573. Kiltz E, Leander G and Malone-Lee J Secure computation of the mean and related statistics Proceedings of the Second international conference on Theory of Cryptography, (283-302)
  574. Rogaway P On the role definitions in and beyond cryptography Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, (13-32)
  575. Goethals B, Laur S, Lipmaa H and Mielikäinen T On private scalar product computation for privacy-preserving data mining Proceedings of the 7th international conference on Information Security and Cryptology, (104-120)
  576. Malkhi D, Nisan N, Pinkas B and Sella Y Fairplay—a secure two-party computation system Proceedings of the 13th conference on USENIX Security Symposium - Volume 13, (20-20)
  577. ACM
    Halpern J and Teague V Rational secret sharing and multiparty computation Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, (623-632)
  578. ACM
    Harnik D, Naor M, Reingold O and Rosen A Completeness in two-party secure computation Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, (252-261)
  579. Bangerter E, Camenisch J and Lysyanskaya A A cryptographic framework for the controlled release of certified data Proceedings of the 12th international conference on Security Protocols, (20-42)
  580. Lindell Y A simpler construction of CCA2-secure public-key encryption under general assumptions Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (241-254)
  581. Zhang J, Chen B, Yu S and Deng H PEFL: A Privacy-Enhanced Federated Learning Scheme for Big Data Analytics 2019 IEEE Global Communications Conference (GLOBECOM), (1-6)
  582. Dov Gordon S, Liu F and Shi E Constant-Round MPC with Fairness and Guarantee of Output Delivery Advances in Cryptology -- CRYPTO 2015, (63-82)
  583. Ishai Y, Kumaresan R, Kushilevitz E and Paskin-Cherniavsky A Secure Computation with Minimal Interaction, Revisited Advances in Cryptology -- CRYPTO 2015, (359-378)
  584. Garg S, Ishai Y, Kushilevitz E, Ostrovsky R and Sahai A Cryptography with One-Way Communication Advances in Cryptology -- CRYPTO 2015, (191-208)
  585. Morita H and Attrapadung N Client-Aided Two-Party Secure Interval Test Protocol Cryptology and Network Security, (328-343)
  586. Goyal R, Kim S, Manohar N, Waters B and Wu D Watermarking Public-Key Cryptographic Primitives Advances in Cryptology – CRYPTO 2019, (367-398)
  587. Hamlin A, Holmgren J, Weiss M and Wichs D On the Plausibility of Fully Homomorphic Encryption for RAMs Advances in Cryptology – CRYPTO 2019, (589-619)
Contributors
  • Weizmann Institute of Science Israel

Recommendations