default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPayman Mohassel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[i48]Mastooreh Salajegheh, Shashank Agrawal, Maliheh Shirvanian, Mihai Christodorescu, Payman Mohassel:
CoRA: Collaborative Risk-Aware Authentication. IACR Cryptol. ePrint Arch. 2022: 1685 (2022)- 2021
- [c51]François Garillot
, Yashvanth Kondi, Payman Mohassel, Valeria Nikolaenko:
Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions. CRYPTO (1) 2021: 127-156 - [c50]Shashank Agrawal, Saikrishna Badrinarayanan, Payman Mohassel, Pratyay Mukherjee, Sikhar Patranabis:
BETA: Biometric-Enabled Threshold Authentication. Public Key Cryptography (2) 2021: 290-318 - [c49]Gayathri Garimella, Payman Mohassel, Mike Rosulek, Saeed Sadeghian, Jaspal Singh:
Private Set Operations from Oblivious Switching. Public Key Cryptography (2) 2021: 591-617 - [i47]Gayathri Garimella, Payman Mohassel, Mike Rosulek, Seyed Saeed Sadeghian, Jaspal Singh:
Private Set Operations from Oblivious Switching. IACR Cryptol. ePrint Arch. 2021: 243 (2021) - [i46]Prasad Buddhavarapu, Benjamin M. Case, Logan Gore, Andrew Knox, Payman Mohassel, Shubho Sengupta, Erik Taubeneck, Min Xue:
Multi-key Private Matching for Compute. IACR Cryptol. ePrint Arch. 2021: 770 (2021) - [i45]François Garillot, Yashvanth Kondi, Payman Mohassel, Valeria Nikolaenko:
Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions. IACR Cryptol. ePrint Arch. 2021: 1055 (2021) - 2020
- [j6]Saba Eskandarian, Mihai Christodorescu, Payman Mohassel:
Privacy-Preserving Payment Splitting. Proc. Priv. Enhancing Technol. 2020(2): 67-88 (2020) - [j5]Payman Mohassel, Mike Rosulek, Ni Trieu:
Practical Privacy-Preserving K-means Clustering. Proc. Priv. Enhancing Technol. 2020(4): 414-433 (2020) - [c48]Payman Mohassel, Peter Rindal, Mike Rosulek:
Fast Database Joins and PSI for Secret Shared Data. CCS 2020: 1271-1287 - [i44]Konstantinos Chalkias, Kevin Lewi, Payman Mohassel, Valeria Nikolaenko:
Distributed Auditing Proofs of Liabilities. IACR Cryptol. ePrint Arch. 2020: 468 (2020) - [i43]Prasad Buddhavarapu, Andrew Knox, Payman Mohassel, Shubho Sengupta, Erik Taubeneck, Vlad Vlaskin:
Private Matching for Compute. IACR Cryptol. ePrint Arch. 2020: 599 (2020) - [i42]Shashank Agrawal, Saikrishna Badrinarayanan, Payman Mohassel, Pratyay Mukherjee, Sikhar Patranabis:
BETA: Biometric Enabled Threshold Authentication. IACR Cryptol. ePrint Arch. 2020: 679 (2020) - [i41]Kevin Lewi, Payman Mohassel, Arnab Roy:
Single-Message Credential-Hiding Login. IACR Cryptol. ePrint Arch. 2020: 1509 (2020)
2010 – 2019
- 2019
- [i40]Jinhyun So, Basak Guler, Amir Salman Avestimehr, Payman Mohassel:
CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning. CoRR abs/1902.00641 (2019) - [i39]Saba Eskandarian, Mihai Christodorescu, Payman Mohassel:
Privacy-Preserving Payment Splitting. CoRR abs/1911.09222 (2019) - [i38]Jinhyun So, Basak Guler, Amir Salman Avestimehr, Payman Mohassel:
CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning. IACR Cryptol. ePrint Arch. 2019: 140 (2019) - [i37]Payman Mohassel, Peter Rindal, Mike Rosulek:
Fast Database Joins for Secret Shared Data. IACR Cryptol. ePrint Arch. 2019: 518 (2019) - [i36]Payman Mohassel, Mike Rosulek, Ni Trieu:
Practical Privacy-Preserving K-means Clustering. IACR Cryptol. ePrint Arch. 2019: 1158 (2019) - 2018
- [c47]Payman Mohassel, Peter Rindal:
ABY3: A Mixed Protocol Framework for Machine Learning. CCS 2018: 35-52 - [c46]Shashank Agrawal, Payman Mohassel, Pratyay Mukherjee, Peter Rindal:
DiSE: Distributed Symmetric-key Encryption. CCS 2018: 1993-2010 - [c45]Shashank Agrawal, Peihan Miao, Payman Mohassel, Pratyay Mukherjee:
PASTA: PASsword-based Threshold Authentication. CCS 2018: 2042-2059 - [c44]Shashank Agrawal, Chaya Ganesh, Payman Mohassel:
Non-Interactive Zero-Knowledge Proofs for Composite Statements. CRYPTO (3) 2018: 643-673 - [i35]Payman Mohassel, Peter Rindal:
ABY3: A Mixed Protocol Framework for Machine Learning. IACR Cryptol. ePrint Arch. 2018: 403 (2018) - [i34]Shashank Agrawal, Chaya Ganesh, Payman Mohassel:
Non-Interactive Zero-Knowledge Proofs for Composite Statements. IACR Cryptol. ePrint Arch. 2018: 557 (2018) - [i33]Shashank Agrawal, Payman Mohassel, Pratyay Mukherjee, Peter Rindal:
DiSE: Distributed Symmetric-key Encryption. IACR Cryptol. ePrint Arch. 2018: 727 (2018) - [i32]Shashank Agrawal, Peihan Miao, Payman Mohassel, Pratyay Mukherjee:
PASTA: PASsword-based Threshold Authentication. IACR Cryptol. ePrint Arch. 2018: 885 (2018) - 2017
- [c43]Nishanth Chandran, Juan A. Garay, Payman Mohassel, Satyanarayana Vusirikala:
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case. CCS 2017: 277-294 - [c42]Payman Mohassel, Mike Rosulek:
Non-interactive Secure 2PC in the Offline/Online and Batch Settings. EUROCRYPT (3) 2017: 425-455 - [c41]Payman Mohassel, Mike Rosulek, Alessandra Scafuro:
Sublinear Zero-Knowledge Arguments for RAM Programs. EUROCRYPT (1) 2017: 501-531 - [c40]Ian Miers, Payman Mohassel:
IO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality. NDSS 2017 - [c39]Payman Mohassel, Yupeng Zhang:
SecureML: A System for Scalable Privacy-Preserving Machine Learning. IEEE Symposium on Security and Privacy 2017: 19-38 - [i31]Arash Afshar, Payman Mohassel, Mike Rosulek:
Efficient Maliciously Secure Two Party Computation for Mixed Programs. IACR Cryptol. ePrint Arch. 2017: 62 (2017) - [i30]Payman Mohassel, Mike Rosulek:
Non-Interactive Secure 2PC in the Offline/Online and Batch Settings. IACR Cryptol. ePrint Arch. 2017: 125 (2017) - [i29]Payman Mohassel, Mike Rosulek, Alessandra Scafuro:
Sublinear Zero-Knowledge Arguments for RAM Programs. IACR Cryptol. ePrint Arch. 2017: 129 (2017) - [i28]Payman Mohassel, Yupeng Zhang:
SecureML: A System for Scalable Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. 2017: 396 (2017) - [i27]Nishanth Chandran, Juan A. Garay, Payman Mohassel, Satyanarayana Vusirikala:
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case. IACR Cryptol. ePrint Arch. 2017: 519 (2017) - 2016
- [j4]Payman Mohassel, Ostap Orobets, Ben Riva:
Efficient Server-Aided 2PC for Mobile Phones. Proc. Priv. Enhancing Technol. 2016(2): 82-99 (2016) - [j3]Özgür Dagdelen, Payman Mohassel, Daniele Venturi:
Rate-limited secure function evaluation. Theor. Comput. Sci. 653: 53-78 (2016) - [c38]Melissa Chase, Chaya Ganesh, Payman Mohassel:
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials. CRYPTO (3) 2016: 499-530 - [c37]Sanjam Garg, Payman Mohassel, Charalampos Papamanthou:
TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption. CRYPTO (3) 2016: 563-592 - [c36]Alptekin Küpçü, Payman Mohassel:
Fast Optimistically Fair Cut-and-Choose 2PC. Financial Cryptography 2016: 208-228 - [i26]Helger Lipmaa, Payman Mohassel, Seyed Saeed Sadeghian:
Valiant's Universal Circuit: Improvements, Implementation, and Applications. IACR Cryptol. ePrint Arch. 2016: 17 (2016) - [i25]Xiong Fan, Juan A. Garay, Payman Mohassel:
Short and Adjustable Signatures. IACR Cryptol. ePrint Arch. 2016: 549 (2016) - [i24]Melissa Chase, Chaya Ganesh, Payman Mohassel:
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials. IACR Cryptol. ePrint Arch. 2016: 583 (2016) - [i23]Ian Miers, Payman Mohassel:
IO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality. IACR Cryptol. ePrint Arch. 2016: 830 (2016) - 2015
- [c35]Payman Mohassel, Mike Rosulek, Ye Zhang:
Fast and Secure Three-party Computation: The Garbled Circuit Approach. CCS 2015: 591-602 - [c34]Zhangxiang Hu, Payman Mohassel, Mike Rosulek:
Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost. CRYPTO (2) 2015: 150-169 - [c33]Arash Afshar, Zhangxiang Hu, Payman Mohassel, Mike Rosulek:
How to Efficiently Evaluate RAM Programs with Malicious Security. EUROCRYPT (1) 2015: 702-729 - [c32]Vladimir Kolesnikov, Payman Mohassel, Ben Riva, Mike Rosulek:
Richer Efficiency/Security Trade-offs in 2PC. TCC (1) 2015: 229-259 - [i22]Vladimir Kolesnikov, Payman Mohassel, Ben Riva, Mike Rosulek:
Richer Efficiency/Security Trade-offs in 2PC. IACR Cryptol. ePrint Arch. 2015: 55 (2015) - [i21]Arash Afshar, Payman Mohassel, Benny Pinkas, Ben Riva:
Non-Interactive Secure Computation Based on Cut-and-Choose. IACR Cryptol. ePrint Arch. 2015: 282 (2015) - [i20]Zhangxiang Hu, Payman Mohassel, Mike Rosulek:
Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost. IACR Cryptol. ePrint Arch. 2015: 497 (2015) - [i19]Payman Mohassel, Mike Rosulek, Ye Zhang:
Fast and Secure Three-party Computation: The Garbled Circuit Approach. IACR Cryptol. ePrint Arch. 2015: 931 (2015) - [i18]Sanjam Garg, Payman Mohassel, Charalampos Papamanthou:
TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption. IACR Cryptol. ePrint Arch. 2015: 1010 (2015) - [i17]Alptekin Küpçü, Payman Mohassel:
Fast Optimistically Fair Cut-and-Choose 2PC. IACR Cryptol. ePrint Arch. 2015: 1209 (2015) - 2014
- [j2]Salman Niksefat, Babak Sadeghiyan, Payman Mohassel, Seyed Saeed Sadeghian:
ZIDS: A Privacy-Preserving Intrusion Detection System Using Secure Two-Party Computation Protocols. Comput. J. 57(4): 494-509 (2014) - [c31]Payman Mohassel, Seyed Saeed Sadeghian, Nigel P. Smart:
Actively Secure Private Function Evaluation. ASIACRYPT (2) 2014: 486-505 - [c30]Ebrahim Tarameshloo, Philip W. L. Fong, Payman Mohassel:
On protection in federated social computing systems. CODASPY 2014: 75-86 - [c29]Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek:
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR. CRYPTO (2) 2014: 440-457 - [c28]Arash Afshar, Payman Mohassel, Benny Pinkas, Ben Riva:
Non-Interactive Secure Computation Based on Cut-and-Choose. EUROCRYPT 2014: 387-404 - [c27]Seny Kamara, Payman Mohassel, Mariana Raykova, Seyed Saeed Sadeghian:
Scaling Private Set Intersection to Billion-Element Sets. Financial Cryptography 2014: 195-215 - [c26]Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill:
Enhanced Chosen-Ciphertext Security and Applications. Public Key Cryptography 2014: 329-344 - [i16]Payman Mohassel, Seyed Saeed Sadeghian, Nigel P. Smart:
Actively Secure Private Function Evaluation. IACR Cryptol. ePrint Arch. 2014: 102 (2014) - [i15]Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek:
FleXOR: Flexible garbling for XOR gates that beats free-XOR. IACR Cryptol. ePrint Arch. 2014: 460 (2014) - [i14]Arash Afshar, Zhangxiang Hu, Payman Mohassel, Mike Rosulek:
How to Efficiently Evaluate RAM Programs with Malicious Security. IACR Cryptol. ePrint Arch. 2014: 759 (2014) - 2013
- [j1]Salman Niksefat, Babak Sadeghiyan, Payman Mohassel:
Oblivious decision program evaluation. IET Inf. Secur. 7(2) (2013) - [c25]Isheeta Nargis, Payman Mohassel, Wayne Eberly:
Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority. AFRICACRYPT 2013: 260-278 - [c24]Payman Mohassel, Ben Riva:
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation. CRYPTO (2) 2013: 36-53 - [c23]Payman Mohassel, Seyed Saeed Sadeghian:
How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation. EUROCRYPT 2013: 557-574 - [c22]Özgür Dagdelen, Payman Mohassel, Daniele Venturi:
Rate-Limited Secure Function Evaluation: Definitions and Constructions. Public Key Cryptography 2013: 461-478 - [e1]Michael J. Jacobson Jr., Michael E. Locasto, Payman Mohassel, Reihaneh Safavi-Naini:
Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Banff, AB, Canada, June 25-28, 2013. Proceedings. Lecture Notes in Computer Science 7954, Springer 2013, ISBN 978-3-642-38979-5 [contents] - [i13]Özgür Dagdelen, Payman Mohassel, Daniele Venturi:
Rate-Limited Secure Function Evaluation: Definitions and Constructions. IACR Cryptol. ePrint Arch. 2013: 21 (2013) - [i12]Payman Mohassel, Ben Riva:
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2013: 51 (2013) - [i11]Payman Mohassel, Seyed Saeed Sadeghian:
How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation. IACR Cryptol. ePrint Arch. 2013: 137 (2013) - 2012
- [c21]Seny Kamara, Payman Mohassel, Ben Riva:
Salus: a system for server-aided secure function evaluation. CCS 2012: 797-808 - [c20]Payman Mohassel, Salman Niksefat, Seyed Saeed Sadeghian, Babak Sadeghiyan:
An Efficient Protocol for Oblivious DFA Evaluation and Applications. CT-RSA 2012: 398-415 - [c19]Payman Mohassel, Salman Niksefat:
Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions. Financial Cryptography 2012: 269-284 - [c18]Mohammad Moshirpour, Payman Mohassel, Armin Eberlein, Behrouz H. Far:
Detection of emergent behavior for internet filtering systems. SMC 2012: 1755-1760 - [i10]Seny Kamara, Payman Mohassel, Ben Riva:
Salus: A System for Server-Aided Secure Function Evaluation. IACR Cryptol. ePrint Arch. 2012: 542 (2012) - [i9]Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill:
Enhanced Chosen-Ciphertext Security and Applications. IACR Cryptol. ePrint Arch. 2012: 543 (2012) - 2011
- [c17]Payman Mohassel:
Fast Computation on Encrypted Polynomials and Applications. CANS 2011: 234-254 - [c16]Mohammad Moshirpour, Payman Mohassel, Behrouz H. Far:
Model based analysis of internet filtering systems. IRI 2011: 494-495 - [i8]Seny Kamara, Payman Mohassel, Mariana Raykova:
Outsourcing Multi-Party Computation. IACR Cryptol. ePrint Arch. 2011: 272 (2011) - [i7]Payman Mohassel, Salman Niksefat, Seyed Saeed Sadeghian, Babak Sadeghiyan:
A New Protocol for Oblivious DFA Evaluation and Applications. IACR Cryptol. ePrint Arch. 2011: 434 (2011) - [i6]Payman Mohassel:
Efficient and Secure Delegation of Linear Algebra. IACR Cryptol. ePrint Arch. 2011: 605 (2011) - 2010
- [c15]Matthew K. Franklin, Payman Mohassel:
Efficient and Secure Evaluation of Multivariate Polynomials and Applications. ACNS 2010: 236-254 - [c14]Payman Mohassel:
A Closer Look at Anonymity and Robustness in Encryption Schemes. ASIACRYPT 2010: 501-518 - [c13]Eike Kiltz, Payman Mohassel, Adam O'Neill:
Adaptive Trapdoor Functions and Chosen-Ciphertext Security. EUROCRYPT 2010: 673-692 - [c12]Payman Mohassel:
One-Time Signatures and Chameleon Hash Functions. Selected Areas in Cryptography 2010: 302-319
2000 – 2009
- 2009
- [c11]Matthew K. Franklin, Mark A. Gondree, Payman Mohassel:
Communication-Efficient Private Protocols for Longest Common Subsequence. CT-RSA 2009: 265-278 - [c10]Mark A. Gondree, Payman Mohassel:
Longest common subsequence as private search. WPES 2009: 81-90 - [i5]Matthew K. Franklin, Mark A. Gondree, Payman Mohassel:
Communication-Efficient Private Protocols for Longest Common Subsequence. IACR Cryptol. ePrint Arch. 2009: 19 (2009) - [i4]Mark A. Gondree, Payman Mohassel:
Longest Common Subsequence as Private Search. IACR Cryptol. ePrint Arch. 2009: 401 (2009) - 2008
- [c9]Payman Mohassel, Enav Weinreb:
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. CRYPTO 2008: 481-496 - [c8]Vipul Goyal, Payman Mohassel, Adam D. Smith:
Efficient Two Party and Multi Party Computation Against Covert Adversaries. EUROCRYPT 2008: 289-306 - 2007
- [c7]Matthew K. Franklin, Mark A. Gondree, Payman Mohassel:
Multi-party Indirect Indexing and Applications. ASIACRYPT 2007: 283-297 - [c6]Matthew K. Franklin, Mark A. Gondree, Payman Mohassel:
Improved Efficiency for Private Stable Matching. CT-RSA 2007: 163-177 - [c5]Nenad Dedic, Payman Mohassel:
Constant-Round Private Database Queries. ICALP 2007: 255-266 - [c4]Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin:
Secure Linear Algebra Using Linearly Recurrent Sequences. TCC 2007: 291-310 - [i3]Matthew K. Franklin, Mark A. Gondree, Payman Mohassel:
Multi-Party Indirect Indexing and Applications. IACR Cryptol. ePrint Arch. 2007: 341 (2007) - 2006
- [c3]Gergei Bana, Payman Mohassel, Till Stegers:
Computational Soundness of Formal Indistinguishability and Static Equivalence. ASIAN 2006: 182-196 - [c2]Payman Mohassel, Matthew K. Franklin:
Efficient Polynomial Operations in the Shared-Coefficients Setting. Public Key Cryptography 2006: 44-57 - [c1]Payman Mohassel, Matthew K. Franklin:
Efficiency Tradeoffs for Malicious Two-Party Computation. Public Key Cryptography 2006: 458-473 - [i2]Gergei Bana, Payman Mohassel, Till Stegers:
Computational Soundness of Formal Indistinguishability and Static Equivalence. IACR Cryptol. ePrint Arch. 2006: 323 (2006) - [i1]Matthew K. Franklin, Mark A. Gondree, Payman Mohassel:
Improved Efficiency for Private Stable Matching. IACR Cryptol. ePrint Arch. 2006: 332 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
