default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvishay Yanai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Jiahui Gao, Ni Trieu, Avishay Yanai:
Multiparty Private Set Intersection Cardinality and Its Applications. Proc. Priv. Enhancing Technol. 2024(2): 73-90 (2024)- [j6]Tamir Tassa, Avishay Yanai:
The Multiple Millionaires' Problem: New Algorithmic Approaches and Protocols. Proc. Priv. Enhancing Technol. 2024(4): 784-796 (2024) - [c19]Guy Zyskind
, Avishay Yanai, Alex Pentland:
Unstoppable Wallets: Chain-assisted Threshold ECDSA and its Applications. AsiaCCS 2024 - [c18]Yaniv Ben-Itzhak, Helen Möllering, Benny Pinkas, Thomas Schneider, Ajith Suresh, Oleksandr Tkachenko, Shay Vargaftik, Christian Weinert, Hossein Yalame, Avishay Yanai:
ScionFL: Efficient and Robust Secure Quantized Aggregation. SaTML 2024: 490-511 - [i26]Tamir Tassa, Avishay Yanai:
The Multiple Millionaires' Problem. IACR Cryptol. ePrint Arch. 2024: 5 (2024) - [i25]Offir Friedman, Avichai Marmor, Dolev Mutzari, Omer Sadika, Yehonatan C. Scaly, Yuval Spiizer, Avishay Yanai:
2PC-MPC: Emulating Two Party ECDSA in Large-Scale MPC. IACR Cryptol. ePrint Arch. 2024: 253 (2024) - [i24]Guy Zyskind, Avishay Yanai, Alex 'Sandy' Pentland:
High-Throughput Three-Party DPFs with Applications to ORAM and Digital Currencies. IACR Cryptol. ePrint Arch. 2024: 1658 (2024) - 2023
- [c17]Anasuya Acharya, Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai:
A New Approach to Garbled Circuits. ACNS 2023: 611-641 - [i23]Yaniv Ben-Itzhak, Helen Möllering, Benny Pinkas, Thomas Schneider, Ajith Suresh, Oleksandr Tkachenko, Shay Vargaftik, Christian Weinert, Hossein Yalame, Avishay Yanai:
ScionFL: Efficient and Robust Secure Quantized Aggregation. IACR Cryptol. ePrint Arch. 2023: 652 (2023) - [i22]Guy Zyskind, Avishay Yanai, Alex 'Sandy' Pentland:
Unstoppable Wallets: Chain-assisted Threshold ECDSA and its Applications. IACR Cryptol. ePrint Arch. 2023: 832 (2023) - [i21]Offir Friedman, Avichai Marmor, Dolev Mutzari, Yehonatan C. Scaly, Yuval Spiizer, Avishay Yanai:
Tiresias: Large Scale, Maliciously Secure Threshold Paillier. IACR Cryptol. ePrint Arch. 2023: 998 (2023) - 2022
- [j5]Ittai Abraham, Gilad Asharov, Avishay Yanai:
Efficient Perfectly Secure Computation with Optimal Resilience. J. Cryptol. 35(4): 27 (2022) - [i20]Yaniv Ben-Itzhak, Helen Möllering, Benny Pinkas, Thomas Schneider, Ajith Suresh, Oleksandr Tkachenko, Shay Vargaftik, Christian Weinert, Hossein Yalame, Avishay Yanai:
ScionFL: Secure Quantized Aggregation for Federated Learning. CoRR abs/2210.07376 (2022) - [i19]Alin Tomescu, Adithya Bhat, Benny Applebaum, Ittai Abraham, Guy Gueta, Benny Pinkas, Avishay Yanai:
UTT: Decentralized Ecash with Accountable Privacy. IACR Cryptol. ePrint Arch. 2022: 452 (2022) - [i18]Ni Trieu, Avishay Yanai, Jiahui Gao:
Multiparty Private Set Intersection Cardinality and Its Applications. IACR Cryptol. ePrint Arch. 2022: 735 (2022) - 2021
- [j4]Tamir Tassa, Tal Grinshpoun, Avishay Yanai:
PC-SyncBB: A privacy preserving collusion secure DCOP algorithm. Artif. Intell. 297: 103501 (2021) - [j3]Lihi Dery, Tamir Tassa, Avishay Yanai:
Fear not, vote truthfully: Secure Multiparty Computation of score based rules. Expert Syst. Appl. 168: 114434 (2021) - [c16]Ofri Nevo, Ni Trieu, Avishay Yanai:
Simple, Fast Malicious Multiparty Private Set Intersection. CCS 2021: 1151-1165 - [c15]Lihi Dery, Tamir Tassa, Avishay Yanai, Arthur Zamarin:
DEMO: A Secure Voting System for Score Based Elections. CCS 2021: 2399-2401 - [c14]Gayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai:
Oblivious Key-Value Stores and Amplification for Private Set Intersection. CRYPTO (2) 2021: 395-425 - [c13]Ittai Abraham, Gilad Asharov, Avishay Yanai:
Efficient Perfectly Secure Computation with Optimal Resilience. TCC (2) 2021: 66-96 - [c12]Rishabh Poddar, Sukrit Kalra, Avishay Yanai, Ryan Deng, Raluca Ada Popa, Joseph M. Hellerstein:
Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. USENIX Security Symposium 2021: 2129-2146 - [i17]Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai:
A New Framework for Garbled Circuits. IACR Cryptol. ePrint Arch. 2021: 739 (2021) - [i16]Gayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai:
Oblivious Key-Value Stores and Amplification for Private Set Intersection. IACR Cryptol. ePrint Arch. 2021: 883 (2021) - [i15]Ittai Abraham, Gilad Asharov, Avishay Yanai:
Efficient Perfectly Secure Computation with Optimal Resilience. IACR Cryptol. ePrint Arch. 2021: 1206 (2021) - [i14]Ofri Nevo, Ni Trieu, Avishay Yanai:
Simple, Fast Malicious Multiparty Private Set Intersection. IACR Cryptol. ePrint Arch. 2021: 1221 (2021) - 2020
- [c11]Ittai Abraham, Benny Pinkas, Avishay Yanai:
Blinder - Scalable, Robust Anonymous Committed Broadcast. CCS 2020: 1233-1252 - [c10]Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai:
PSI from PaXoS: Fast, Malicious Private Set Intersection. EUROCRYPT (2) 2020: 739-767 - [c9]Carsten Baum, Tore Kasper Frederiksen, Julia Hesse, Anja Lehmann, Avishay Yanai:
PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. EuroS&P 2020: 587-606 - [i13]Rishabh Poddar, Sukrit Kalra, Avishay Yanai, Ryan Deng, Raluca Ada Popa, Joseph M. Hellerstein:
Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. CoRR abs/2010.13752 (2020) - [i12]Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai:
PSI from PaXoS: Fast, Malicious Private Set Intersection. IACR Cryptol. ePrint Arch. 2020: 193 (2020) - [i11]Ittai Abraham, Benny Pinkas, Avishay Yanai:
Blinder: MPC Based Scalable and Robust Anonymous Committed Broadcast. IACR Cryptol. ePrint Arch. 2020: 248 (2020) - [i10]Rishabh Poddar, Sukrit Kalra, Avishay Yanai, Ryan Deng, Raluca Ada Popa, Joseph M. Hellerstein:
Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. IACR Cryptol. ePrint Arch. 2020: 1350 (2020)
2010 – 2019
- 2019
- [j2]Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai:
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ. J. Cryptol. 32(3): 1026-1069 (2019) - [j1]Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. J. Cryptol. 32(4): 1144-1199 (2019) - [c8]Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai:
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. CRYPTO (3) 2019: 401-431 - [c7]Benny Pinkas, Thomas Schneider, Oleksandr Tkachenko, Avishay Yanai:
Efficient Circuit-Based PSI with Linear Communication. EUROCRYPT (3) 2019: 122-153 - [c6]Tamir Tassa, Tal Grinshpoun, Avishay Yanai:
A Privacy Preserving Collusion Secure DCOP Algorithm. IJCAI 2019: 4774-4780 - [i9]Tamir Tassa, Tal Grinshpoun, Avishay Yanai:
A Privacy Preserving Collusion Secure DCOP Algorithm. CoRR abs/1905.09013 (2019) - [i8]Benny Pinkas, Thomas Schneider, Oleksandr Tkachenko, Avishay Yanai:
Efficient Circuit-based PSI with Linear Communication. IACR Cryptol. ePrint Arch. 2019: 241 (2019) - [i7]Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai:
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. IACR Cryptol. ePrint Arch. 2019: 634 (2019) - [i6]Carsten Baum, Tore Kasper Frederiksen, Julia Hesse, Anja Lehmann, Avishay Yanai:
PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. IACR Cryptol. ePrint Arch. 2019: 1470 (2019) - 2018
- [c5]Marcel Keller, Avishay Yanai:
Efficient Maliciously Secure Multiparty Computation for RAM. EUROCRYPT (3) 2018: 91-124 - [c4]Tore Kasper Frederiksen, Benny Pinkas, Avishay Yanai:
Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments. Public Key Cryptography (1) 2018: 587-619 - [c3]Yehuda Lindell, Avishay Yanai:
Fast Garbling of Circuits over 3-Valued Logic. Public Key Cryptography (1) 2018: 620-643 - 2017
- [i5]Tore Kasper Frederiksen, Benny Pinkas, Avishay Yanai:
Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments. IACR Cryptol. ePrint Arch. 2017: 550 (2017) - [i4]Marcel Keller, Avishay Yanai:
Efficient Maliciously Secure Multiparty Computation for RAM. IACR Cryptol. ePrint Arch. 2017: 981 (2017) - [i3]Yehuda Lindell, Avishay Yanai:
Fast Garbling of Circuits over 3-Valued Logic. IACR Cryptol. ePrint Arch. 2017: 1225 (2017) - 2016
- [c2]Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. TCC (B1) 2016: 521-553 - [i2]Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. IACR Cryptol. ePrint Arch. 2016: 805 (2016) - 2015
- [c1]Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai:
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ. CRYPTO (2) 2015: 319-338 - [i1]Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai:
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ. IACR Cryptol. ePrint Arch. 2015: 523 (2015)
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 2024-11-11 21:26 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:
