Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafail Ostrovsky
Rafail M. Ostrovsky
Person information
- affiliation: University of California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j65]Brett Hemenway Falk, Rohit Nema
, Rafail Ostrovsky:
Linear-time 2-party secure merge from additively homomorphic encryption. J. Comput. Syst. Sci. 137: 37-49 (2023)- [c276]Samuel Dittmer, Karim Eldefrawy, Stéphane Graham-Lengrand, Steve Lu, Rafail Ostrovsky, Vitor Pereira:
Boosting the Performance of High-Assurance Cryptography: Parallel Execution and Optimizing Memory Access in Formally-Verified Line-Point Zero-Knowledge. CCS 2023: 2098-2112 - [c275]Vipul Goyal, Chen-Da Liu-Zhang, Rafail Ostrovsky:
Asymmetric Multi-Party Computation. ITC 2023: 6:1-6:25 - [c274]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits - A Circuit Model that Captures RAM. CRYPTO (4) 2023: 128-160 - [c273]Yuval Ishai, Rafail Ostrovsky, Akash Shah:
Succinct Arguments for RAM Programs via Projection Codes. CRYPTO (2) 2023: 159-192 - [c272]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. CRYPTO (1) 2023: 459-488 - [c271]Brett Hemenway Falk, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
GigaDORAM: Breaking the Billion Address Barrier. USENIX Security Symposium 2023: 3871-3888 - [i184]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits: A Circuit Model that Captures RAM. Electron. Colloquium Comput. Complex. TR23 (2023) - [i183]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits: A Better Model of Computation for Garbling. IACR Cryptol. ePrint Arch. 2023: 455 (2023) - [i182]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
DORAM revisited: Maliciously secure RAM-MPC with logarithmic overhead. IACR Cryptol. ePrint Arch. 2023: 578 (2023) - [i181]Vipul Goyal, Chen-Da Liu-Zhang, Rafail Ostrovsky:
Asymmetric Multi-Party Computation. IACR Cryptol. ePrint Arch. 2023: 704 (2023) - [i180]Wutichai Chongchitmate, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
PSI from ring-OLE. IACR Cryptol. ePrint Arch. 2023: 745 (2023) - [i179]Samuel Dittmer, Karim Eldefrawy, Stéphane Graham-Lengrand, Steve Lu, Rafail Ostrovsky, Vitor Pereira:
Boosting the Performance of High-Assurance Cryptography: Parallel Execution and Optimizing Memory Access in Formally-Verified Line-Point Zero-Knowledge. IACR Cryptol. ePrint Arch. 2023: 1322 (2023) - [i178]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. IACR Cryptol. ePrint Arch. 2023: 1512 (2023) - [i177]Cruz Barnum, David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Adaptive Garbled Circuits and Garbled RAM from Non-Programmable Random Oracles. IACR Cryptol. ePrint Arch. 2023: 1527 (2023) - 2022
- [j64]Shaan Mathur, Rafail Ostrovsky:
A combinatorial characterization of self-stabilizing population protocols. Inf. Comput. 285(Part): 104829 (2022) - [j63]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A refined approximation for Euclidean k-means. Inf. Process. Lett. 176: 106251 (2022) - [j62]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. J. Cryptol. 35(3): 15 (2022) - [c270]Wutichai Chongchitmate, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
PSI from Ring-OLE. CCS 2022: 531-545 - [c269]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One. CCS 2022: 829-841 - [c268]Nishanth Chandran, Pouyan Forghani, Juan A. Garay, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas:
Universally Composable Almost-Everywhere Secure Computation. ITC 2022: 14:1-14:25 - [c267]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
Authenticated Garbling from Simple Correlations. CRYPTO (4) 2022: 57-87 - [c266]Brett Hemenway Falk, Rohit Nema, Rafail Ostrovsky:
A Linear-Time 2-Party Secure Merge Protocol. CSCML 2022: 408-427 - [c265]Michele Ciampi, Muhammad Ishaq, Malik Magdon-Ismail, Rafail Ostrovsky, Vassilis Zikas:
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker. CSCML 2022: 428-446 - [c264]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
EpiGRAM: Practical Garbled RAM. EUROCRYPT (1) 2022: 3-33 - [c263]Abida Haque, David Heath, Vladimir Kolesnikov, Steve Lu, Rafail Ostrovsky, Akash Shah:
Garbled Circuits with Sublinear Evaluator. EUROCRYPT (1) 2022: 37-64 - [c262]Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas:
Round-Optimal and Communication-Efficient Multiparty Computation. EUROCRYPT (1) 2022: 65-95 - [c261]Laasya Bangalore, Rafail Ostrovsky, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
Adaptively Secure Computation for RAM Programs. EUROCRYPT (2) 2022: 187-216 - [c260]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
CNF-FSS and Its Applications. Public Key Cryptography (1) 2022: 283-314 - [c259]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
3-Party Distributed ORAM from Oblivious Set Membership. SCN 2022: 437-461 - [c258]Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou:
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares. SCN 2022: 516-539 - [c257]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte, Angelos Stavrou:
Streaming and Unbalanced PSI from Function Secret Sharing. SCN 2022: 564-587 - [i176]Brett Hemenway Falk, Rohit Nema, Rafail Ostrovsky:
A Linear-Time 2-Party Secure Merge Protocol. IACR Cryptol. ePrint Arch. 2022: 380 (2022) - [i175]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One. IACR Cryptol. ePrint Arch. 2022: 552 (2022) - [i174]Mark Blunk, Paul Bunn, Samuel Dittmer, Steve Lu, Rafail Ostrovsky:
Secure Merge in Linear Time and O(log log N) Rounds. IACR Cryptol. ePrint Arch. 2022: 590 (2022) - [i173]Abida Haque, David Heath, Vladimir Kolesnikov, Steve Lu, Rafail Ostrovsky, Akash Shah:
Garbled Circuits With Sublinear Evaluator. IACR Cryptol. ePrint Arch. 2022: 797 (2022) - [i172]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
Authenticated Garbling from Simple Correlations. IACR Cryptol. ePrint Arch. 2022: 836 (2022) - [i171]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
Anonymous Permutation Routing. IACR Cryptol. ePrint Arch. 2022: 1353 (2022) - 2021
- [j61]Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud:
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. SIAM J. Discret. Math. 35(1): 465-484 (2021) - [c256]Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (With Outliers). APPROX-RANDOM 2021: 16:1-16:16 - [c255]Sanjam Garg, Mohammad Hajiabadi, Giulio Malavolta, Rafail Ostrovsky:
How to Build a Trapdoor Function from an Encryption Scheme. ASIACRYPT (3) 2021: 220-249 - [c254]Nicholas Franzese, Jonathan Katz, Steve Lu, Rafail Ostrovsky, Xiao Wang, Chenkai Weng:
Constant-Overhead Zero-Knowledge for RAM Programs. CCS 2021: 178-191 - [c253]Xiaoqi Duan, Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ACCO: Algebraic Computation with Comparison. CCSW 2021: 21-38 - [c252]Samuel Dittmer, Yuval Ishai, Rafail Ostrovsky:
Line-Point Zero Knowledge and Its Applications. ITC 2021: 5:1-5:24 - [c251]Brett Hemenway Falk, Rafail Ostrovsky:
Secure Merge with O(n log log n) Secure Operations. ITC 2021: 7:1-7:29 - [c250]Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. CRYPTO (2) 2021: 244-274 - [c249]Michele Ciampi, Vipul Goyal, Rafail Ostrovsky:
Threshold Garbled Circuits and Ad Hoc Secure Computation. EUROCRYPT (3) 2021: 64-93 - [c248]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a Solution. EUROCRYPT (3) 2021: 338-369 - [c247]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. TCC (2) 2021: 518-549 - [i170]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A Refined Approximation for Euclidean k-Means. CoRR abs/2107.07358 (2021) - [i169]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
CNF-FSS and its Applications. IACR Cryptol. ePrint Arch. 2021: 163 (2021) - [i168]Michele Ciampi, Vipul Goyal, Rafail Ostrovsky:
Threshold Garbled Circuits and Ad Hoc Secure Computation. IACR Cryptol. ePrint Arch. 2021: 308 (2021) - [i167]Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou:
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares. IACR Cryptol. ePrint Arch. 2021: 576 (2021) - [i166]Michele Ciampi, Muhammad Ishaq, Malik Magdon-Ismail, Rafail Ostrovsky, Vassilis Zikas:
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker. IACR Cryptol. ePrint Arch. 2021: 609 (2021) - [i165]Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. IACR Cryptol. ePrint Arch. 2021: 833 (2021) - [i164]Nicholas Franzese, Jonathan Katz, Steve Lu, Rafail Ostrovsky, Xiao Wang, Chenkai Weng:
Constant-Overhead Zero-Knowledge for RAM Programs. IACR Cryptol. ePrint Arch. 2021: 979 (2021) - [i163]Nishanth Chandran, Pouyan Forghani, Juan A. Garay, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas:
Universally Composable Almost-Everywhere Secure Computation. IACR Cryptol. ePrint Arch. 2021: 1398 (2021) - [i162]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. IACR Cryptol. ePrint Arch. 2021: 1433 (2021) - [i161]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
3-Party Distributed ORAM from Oblivious Set Membership. IACR Cryptol. ePrint Arch. 2021: 1463 (2021) - [i160]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Practical Garbled RAM: GRAM with O(log2 n) Overhead. IACR Cryptol. ePrint Arch. 2021: 1519 (2021) - 2020
- [j60]Paul Bunn, Rafail Ostrovsky:
Oblivious Sampling with Applications to Two-Party k-Means Clustering. J. Cryptol. 33(3): 1362-1403 (2020) - [j59]Ran Gelles, Rafail Ostrovsky, Alan Roytman:
Efficient Error-Correcting Codes for Sliding Windows. SIAM J. Discret. Math. 34(1): 904-937 (2020) - [c246]Ohad Barta, Yuval Ishai, Rafail Ostrovsky, David J. Wu:
On Succinct Arguments and Witness Encryption from Groups. CRYPTO (1) 2020: 776-806 - [c245]Juan A. Garay, Aggelos Kiayias, Rafail M. Ostrovsky, Giorgos Panagiotakos, Vassilis Zikas:
Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era. EUROCRYPT (2) 2020: 129-158 - [c244]Leonard Kleinrock, Rafail Ostrovsky, Vassilis Zikas:
Proof-of-Reputation Blockchain with Nakamoto Fallback. INDOCRYPT 2020: 16-38 - [c243]Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky, Moti Yung:
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups. SCN 2020: 108-129 - [c242]Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. SCN 2020: 215-232 - [c241]Samuel Dittmer, Rafail Ostrovsky:
Oblivious Tight Compaction In O(n) Time with Smaller Constant. SCN 2020: 253-274 - [c240]Shaan Mathur, Rafail Ostrovsky:
A Combinatorial Characterization of Self-stabilizing Population Protocols. SSS 2020: 167-182 - [c239]Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky:
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. TCC (1) 2020: 88-116 - [c238]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Round Optimal Secure Multiparty Computation from Minimal Assumptions. TCC (2) 2020: 291-319 - [i159]Shaan Mathur, Rafail Ostrovsky:
A Combinatorial Characterization of Self-Stabilizing Population Protocols. CoRR abs/2010.03869 (2020) - [i158]Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (with Outliers). CoRR abs/2011.12169 (2020) - [i157]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte, Angelos Stavrou:
Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing. CoRR abs/2012.13053 (2020) - [i156]Samuel Dittmer, Rafail Ostrovsky:
Oblivious tight compaction in O(n) time with smaller constant. IACR Cryptol. ePrint Arch. 2020: 377 (2020) - [i155]Leonard Kleinrock, Rafail Ostrovsky, Vassilis Zikas:
A PoR/PoS-Hybrid Blockchain: Proof of Reputation with Nakamoto Fallback. IACR Cryptol. ePrint Arch. 2020: 381 (2020) - [i154]Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky, Moti Yung:
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups. IACR Cryptol. ePrint Arch. 2020: 747 (2020) - [i153]Brett Hemenway Falk, Rafail Ostrovsky:
Secure merge with O(n log log n) secure operation. IACR Cryptol. ePrint Arch. 2020: 807 (2020) - [i152]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Alibi: A Flaw in Cuckoo-Hashing based Hierarchical ORAM Schemes and a Solution. IACR Cryptol. ePrint Arch. 2020: 997 (2020) - [i151]Ohad Barta, Yuval Ishai, Rafail Ostrovsky, David J. Wu:
On Succinct Arguments and Witness Encryption from Groups. IACR Cryptol. ePrint Arch. 2020: 1319 (2020) - [i150]Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas:
Round-Optimal and Communication-Efficient Multiparty Computation. IACR Cryptol. ePrint Arch. 2020: 1437 (2020) - [i149]Samuel Dittmer, Yuval Ishai, Rafail Ostrovsky:
Line-Point Zero Knowledge and Its Applications. IACR Cryptol. ePrint Arch. 2020: 1446 (2020) - [i148]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte, Angelos Stavrou:
Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing. IACR Cryptol. ePrint Arch. 2020: 1599 (2020)
2010 – 2019
- 2019
- [j58]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A stable marriage requires communication. Games Econ. Behav. 118: 626-647 (2019) - [c237]Saikrishna Badrinarayanan, Abhishek Jain, Rafail Ostrovsky, Ivan Visconti:
UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens. ASIACRYPT (2) 2019: 577-605 - [c236]Nico Döttling, Sanjam Garg, Yuval Ishai, Giulio Malavolta, Tamer Mour, Rafail Ostrovsky:
Trapdoor Hash Functions and Their Applications. CRYPTO (3) 2019: 3-32 - [c235]Nishanth Chandran, Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti:
Universally Composable Secure Computation with Corrupted Tokens. CRYPTO (3) 2019: 432-461 - [c234]Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, Vinod Vaikuntanathan:
Reusable Non-Interactive Secure Computation. CRYPTO (3) 2019: 462-488 - [c233]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptographic Sensing. CRYPTO (3) 2019: 583-604 - [c232]Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs:
Private Anonymous Data Access. EUROCRYPT (2) 2019: 244-273 - [c231]Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud:
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. TCC (2) 2019: 386-406 - [c230]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Private Set Intersection with Linear Communication from General Assumptions. WPES@CCS 2019: 14-25 - [c229]Brett Hemenway Falk, Steve Lu, Rafail Ostrovsky:
DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls. WPES@CCS 2019: 26-36 - [i147]Michele Ciampi, Rafail Ostrovsky:
Four-Round Secure Multiparty Computation from General Assumptions. IACR Cryptol. ePrint Arch. 2019: 214 (2019) - [i146]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
On Round Optimal Secure Multiparty Computation from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2019: 216 (2019) - [i145]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptographic Sensing. IACR Cryptol. ePrint Arch. 2019: 637 (2019) - [i144]Nico Döttling, Sanjam Garg, Yuval Ishai, Giulio Malavolta, Tamer Mour, Rafail Ostrovsky:
Trapdoor Hash Functions and Their Applications. IACR Cryptol. ePrint Arch. 2019: 639 (2019) - [i143]Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky:
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. IACR Cryptol. ePrint Arch. 2019: 990 (2019) - [i142]Juan A. Garay, Aggelos Kiayias, Rafail Ostrovsky, Giorgos Panagiotakos, Vassilis Zikas:
Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast). IACR Cryptol. ePrint Arch. 2019: 1264 (2019) - 2018
- [j57]Brett Hemenway, Rafail Ostrovsky:
Efficient robust secret sharing from expander graphs. Cryptogr. Commun. 10(1): 79-99 (2018) - [j56]George Alter, Brett Hemenway Falk, Steve Lu, Rafail Ostrovsky:
Computing Statistics from Private Data. Data Sci. J. 17: 31 (2018) - [c228]Saikrishna Badrinarayanan, Abhishek Jain, Rafail Ostrovsky, Ivan Visconti:
Non-interactive Secure Computation from One-Way Functions. ASIACRYPT (3) 2018: 118-138 - [c227]Karim Eldefrawy, Rafail Ostrovsky, Moti Yung:
Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation. From Database to Cyber Security 2018: 470-486 - [c226]Quinn Grier, Brett Hemenway Falk, Steve Lu, Rafail Ostrovsky:
ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices. MPS@CCS 2018: 61-70 - [c225]Yun Lu, Konstantinos Mitropoulos, Rafail Ostrovsky, Avraham Weinstock, Vassilis Zikas:
Cryptographically Secure Detection of Injection Attacks. CCS 2018: 2240-2242 - [c224]Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. CRYPTO (3) 2018: 515-544 - [c223]Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti:
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions. CRYPTO (3) 2018: 608-639 - [c222]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. ICALP 2018: 93:1-93:11 - [c221]Yuval Ishai, Manika Mittal, Rafail Ostrovsky:
On the Message Complexity of Secure Multiparty Computation. Public Key Cryptography (1) 2018: 698-711 - [c220]Shafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro, Adam Sealfon:
Population Stability: Regulating Size in the Presence of an Adversary. PODC 2018: 397-406 - [c219]Karim Eldefrawy, Rafail Ostrovsky, Sunoo Park, Moti Yung:
Proactive Secure Multiparty Computation with a Dishonest Majority. SCN 2018: 200-215 - [c218]Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box "Commit-and-Prove". TCC (1) 2018: 286-313 - [c217]Wutichai Chongchitmate, Rafail Ostrovsky:
Information-Theoretic Broadcast with Dishonest Majority for Long Messages. TCC (1) 2018: 370-388 - [i141]Shafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro, Adam Sealfon:
Population stability: regulating size in the presence of an adversary. CoRR abs/1803.02540 (2018) - [i140]Yuval Ishai, Manika Mittal, Rafail Ostrovsky:
On the Message Complexity of Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2018: 38 (2018) - [i139]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Private Set Intersection with Linear Communication from General Assumptions. IACR Cryptol. ePrint Arch. 2018: 238 (2018) - [i138]Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs:
Private Anonymous Data Access. IACR Cryptol. ePrint Arch. 2018: 363 (2018) - [i137]Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti:
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2018: 542 (2018) - [i136]Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. IACR Cryptol. ePrint Arch. 2018: 549 (2018) - [i135]Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. IACR Cryptol. ePrint Arch. 2018: 706 (2018) - [i134]Wutichai Chongchitmate, Rafail Ostrovsky:
Information-Theoretic Broadcast with Dishonest Majority for Long Messages. IACR Cryptol. ePrint Arch. 2018: 829 (2018) - [i133]Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box “Commit-and-Prove”. IACR Cryptol. ePrint Arch. 2018: 921 (2018) - [i132]Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, Vinod Vaikuntanathan:
Reusable Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2018: 940 (2018) - [i131]