Avishay Yanai

Orcid: 0000-0003-4060-0150

According to our database1, Avishay Yanai authored at least 32 papers between 2017 and 2024.

Collaborative distances:

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
5
3
3
5
3
5
3
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Multiple Millionaires' Problem: New Algorithmic Approaches and Protocols.
Proc. Priv. Enhancing Technol., 2024

Multiparty Private Set Intersection Cardinality and Its Applications.
Proc. Priv. Enhancing Technol., 2024

High-Throughput Three-Party DPFs with Applications to ORAM and Digital Currencies.
IACR Cryptol. ePrint Arch., 2024

The Multiple Millionaires' Problem.
IACR Cryptol. ePrint Arch., 2024

2PC-MPC: Emulating Two Party ECDSA in Large-Scale MPC.
IACR Cryptol. ePrint Arch., 2024

Tiresias: Large Scale, UC-Secure Threshold Paillier.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Unstoppable Wallets: Chain-assisted Threshold ECDSA and its Applications.
IACR Cryptol. ePrint Arch., 2023

Tiresias: Large Scale, Maliciously Secure Threshold Paillier.
IACR Cryptol. ePrint Arch., 2023

ScionFL: Efficient and Robust Secure Quantized Aggregation.
IACR Cryptol. ePrint Arch., 2023

A New Approach to Garbled Circuits.
Proceedings of the Applied Cryptography and Network Security, 2023

2022
Efficient Perfectly Secure Computation with Optimal Resilience.
J. Cryptol., 2022

UTT: Decentralized Ecash with Accountable Privacy.
IACR Cryptol. ePrint Arch., 2022

ScionFL: Secure Quantized Aggregation for Federated Learning.
CoRR, 2022

2021
Simple, Fast Malicious Multiparty Private Set Intersection.
IACR Cryptol. ePrint Arch., 2021

Oblivious Key-Value Stores and Amplification for Private Set Intersection.
IACR Cryptol. ePrint Arch., 2021

A New Framework for Garbled Circuits.
IACR Cryptol. ePrint Arch., 2021

Fear not, vote truthfully: Secure Multiparty Computation of score based rules.
Expert Syst. Appl., 2021

PC-SyncBB: A privacy preserving collusion secure DCOP algorithm.
Artif. Intell., 2021

DEMO: A Secure Voting System for Score Based Elections.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics.
IACR Cryptol. ePrint Arch., 2020

PSI from PaXoS: Fast, Malicious Private Set Intersection.
IACR Cryptol. ePrint Arch., 2020

Blinder: MPC Based Scalable and Robust Anonymous Committed Broadcast.
IACR Cryptol. ePrint Arch., 2020

Blinder - Scalable, Robust Anonymous Committed Broadcast.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ.
J. Cryptol., 2019

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model.
J. Cryptol., 2019

Efficient Circuit-based PSI with Linear Communication.
IACR Cryptol. ePrint Arch., 2019

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension.
IACR Cryptol. ePrint Arch., 2019

PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server.
IACR Cryptol. ePrint Arch., 2019

A Privacy Preserving Collusion Secure DCOP Algorithm.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2017
Fast Garbling of Circuits over 3-Valued Logic.
IACR Cryptol. ePrint Arch., 2017

Efficient Maliciously Secure Multiparty Computation for RAM.
IACR Cryptol. ePrint Arch., 2017

Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments.
IACR Cryptol. ePrint Arch., 2017


  Loading...