Payman Mohassel

According to our database1, Payman Mohassel authored at least 73 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
CoRA: Collaborative Risk-Aware Authentication.
IACR Cryptol. ePrint Arch., 2022

2021
Private Set Operations from Oblivious Switching.
IACR Cryptol. ePrint Arch., 2021

Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2021

Multi-key Private Matching for Compute.
IACR Cryptol. ePrint Arch., 2021

Private Set Operations from Oblivious Switching.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

2020
Practical Privacy-Preserving K-means Clustering.
Proc. Priv. Enhancing Technol., 2020

Privacy-Preserving Payment Splitting.
Proc. Priv. Enhancing Technol., 2020

Single-Message Credential-Hiding Login.
IACR Cryptol. ePrint Arch., 2020

Distributed Auditing Proofs of Liabilities.
IACR Cryptol. ePrint Arch., 2020

Private Matching for Compute.
IACR Cryptol. ePrint Arch., 2020

BETA: Biometric Enabled Threshold Authentication.
IACR Cryptol. ePrint Arch., 2020

Fast Database Joins and PSI for Secret Shared Data.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning.
IACR Cryptol. ePrint Arch., 2019

Fast Database Joins for Secret Shared Data.
IACR Cryptol. ePrint Arch., 2019

2018
ABY3: A Mixed Protocol Framework for Machine Learning.
IACR Cryptol. ePrint Arch., 2018

DiSE: Distributed Symmetric-key Encryption.
IACR Cryptol. ePrint Arch., 2018

PASTA: PASsword-based Threshold Authentication.
IACR Cryptol. ePrint Arch., 2018

Non-Interactive Zero-Knowledge Proofs for Composite Statements.
IACR Cryptol. ePrint Arch., 2018

ABY<sup>3</sup>: A Mixed Protocol Framework for Machine Learning.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
SecureML: A System for Scalable Privacy-Preserving Machine Learning.
IACR Cryptol. ePrint Arch., 2017

Sublinear Zero-Knowledge Arguments for RAM Programs.
IACR Cryptol. ePrint Arch., 2017

Non-Interactive Secure 2PC in the Offline/Online and Batch Settings.
IACR Cryptol. ePrint Arch., 2017

Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case.
IACR Cryptol. ePrint Arch., 2017

Efficient Maliciously Secure Two Party Computation for Mixed Programs.
IACR Cryptol. ePrint Arch., 2017

2016
Rate-limited secure function evaluation.
Theor. Comput. Sci., 2016

Efficient Server-Aided 2PC for Mobile Phones.
Proc. Priv. Enhancing Technol., 2016

IO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality.
IACR Cryptol. ePrint Arch., 2016

Valiant's Universal Circuit: Improvements, Implementation, and Applications.
IACR Cryptol. ePrint Arch., 2016

Short and Adjustable Signatures.
IACR Cryptol. ePrint Arch., 2016

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials.
IACR Cryptol. ePrint Arch., 2016

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Fast and Secure Three-party Computation: The Garbled Circuit Approach.
IACR Cryptol. ePrint Arch., 2015

Fast Optimistically Fair Cut-and-Choose 2PC.
IACR Cryptol. ePrint Arch., 2015

Richer Efficiency/Security Trade-offs in 2PC.
IACR Cryptol. ePrint Arch., 2015

Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost.
IACR Cryptol. ePrint Arch., 2015

TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption.
IACR Cryptol. ePrint Arch., 2015

Non-Interactive Secure Computation Based on Cut-and-Choose.
IACR Cryptol. ePrint Arch., 2015

2014
Actively Secure Private Function Evaluation.
IACR Cryptol. ePrint Arch., 2014

FleXOR: Flexible garbling for XOR gates that beats free-XOR.
IACR Cryptol. ePrint Arch., 2014

How to Efficiently Evaluate RAM Programs with Malicious Security.
IACR Cryptol. ePrint Arch., 2014

ZIDS: A Privacy-Preserving Intrusion Detection System Using Secure Two-Party Computation Protocols.
Comput. J., 2014

Scaling Private Set Intersection to Billion-Element Sets.
Proceedings of the Financial Cryptography and Data Security, 2014

On protection in federated social computing systems.
Proceedings of the Fourth ACM Conference on Data and Application Security and Privacy, 2014

2013
Oblivious decision program evaluation.
IET Inf. Secur., 2013

How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation.
IACR Cryptol. ePrint Arch., 2013

Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2013

Rate-Limited Secure Function Evaluation: Definitions and Constructions.
IACR Cryptol. ePrint Arch., 2013

Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority.
Proceedings of the Progress in Cryptology, 2013

2012
Salus: A System for Server-Aided Secure Function Evaluation.
IACR Cryptol. ePrint Arch., 2012

Enhanced Chosen-Ciphertext Security and Applications.
IACR Cryptol. ePrint Arch., 2012

Detection of emergent behavior for internet filtering systems.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2012

Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions.
Proceedings of the Financial Cryptography and Data Security, 2012

An Efficient Protocol for Oblivious DFA Evaluation and Applications.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

2011
A New Protocol for Oblivious DFA Evaluation and Applications.
IACR Cryptol. ePrint Arch., 2011

Efficient and Secure Delegation of Linear Algebra.
IACR Cryptol. ePrint Arch., 2011

Outsourcing Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2011

Model based analysis of internet filtering systems.
Proceedings of the IEEE International Conference on Information Reuse and Integration, 2011

Fast Computation on Encrypted Polynomials and Applications.
Proceedings of the Cryptology and Network Security - 10th International Conference, 2011

2010
One-Time Signatures and Chameleon Hash Functions.
Proceedings of the Selected Areas in Cryptography - 17th International Workshop, 2010

Adaptive Trapdoor Functions and Chosen-Ciphertext Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

A Closer Look at Anonymity and Robustness in Encryption Schemes.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

Efficient and Secure Evaluation of Multivariate Polynomials and Applications.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
Longest Common Subsequence as Private Search.
IACR Cryptol. ePrint Arch., 2009

Communication-Efficient Private Protocols for Longest Common Subsequence.
IACR Cryptol. ePrint Arch., 2009

2008
Efficient Two Party and Multi Party Computation Against Covert Adversaries.
Proceedings of the Advances in Cryptology, 2008

Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries.
Proceedings of the Advances in Cryptology, 2008

2007
Multi-Party Indirect Indexing and Applications.
IACR Cryptol. ePrint Arch., 2007

Secure Linear Algebra Using Linearly Recurrent Sequences.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Constant-Round Private Database Queries.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Improved Efficiency for Private Stable Matching.
IACR Cryptol. ePrint Arch., 2006

Computational Soundness of Formal Indistinguishability and Static Equivalence.
IACR Cryptol. ePrint Arch., 2006

Efficiency Tradeoffs for Malicious Two-Party Computation.
Proceedings of the Public Key Cryptography, 2006

Efficient Polynomial Operations in the Shared-Coefficients Setting.
Proceedings of the Public Key Cryptography, 2006


  Loading...