The following pages link to Payman Mohassel (Q329718):
Displaying 34 items.
- Rate-limited secure function evaluation (Q329720) (← links)
- Non-interactive zero-knowledge proofs for composite statements (Q776004) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Private set operations from oblivious switching (Q2061976) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation (Q2849385) (← links)
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR (Q2874552) (← links)
- An Efficient Protocol for Oblivious DFA Evaluation and Applications (Q2890023) (← links)
- Actively Secure Private Function Evaluation (Q2936625) (← links)
- How to Efficiently Evaluate RAM Programs with Malicious Security (Q2948351) (← links)
- A Closer Look at Anonymity and Robustness in Encryption Schemes (Q3058675) (← links)
- One-Time Signatures and Chameleon Hash Functions (Q3084263) (← links)
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost (Q3457064) (← links)
- Adaptive Trapdoor Functions and Chosen-Ciphertext Security (Q3563861) (← links)
- Efficient and Secure Evaluation of Multivariate Polynomials and Applications (Q3575049) (← links)
- Secure Linear Algebra Using Linearly Recurrent Sequences (Q3596387) (← links)
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries (Q3600236) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- Rate-Limited Secure Function Evaluation: Definitions and Constructions (Q4916025) (← links)
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation (Q4924432) (← links)
- Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority (Q4924688) (← links)
- Richer Efficiency/Security Trade-offs in 2PC (Q5261631) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Improved Efficiency for Private Stable Matching (Q5385951) (← links)
- Multi-party Indirect Indexing and Applications (Q5387105) (← links)
- Enhanced Chosen-Ciphertext Security and Applications (Q5402979) (← links)
- Non-Interactive Secure Computation Based on Cut-and-Choose (Q5418707) (← links)
- Constant-Round Private Database Queries (Q5428814) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
- Fast Optimistically Fair Cut-and-Choose 2PC (Q5857776) (← links)
- Public Key Cryptography - PKC 2006 (Q5898935) (← links)
- Public Key Cryptography - PKC 2006 (Q5898961) (← links)