Recent publications

 

By CPIIS members and students:

 

2020

 

Iftach Haitner, Omer Reingold, Salil Vadhan, Hoeteck Wee, Inaccessible Entropy I:Inaccessible Entropy Generators and Statistically HidingCommitments from One-Way Functions, 2020

 

Dror Chawin, Iftach Haitner and Noam Mazor, Lower Bounds on the Time/Memory Tradeoff ofFunction Inversion, 2020.

 

 

Iftach Haitner and Yonatan Karidi-Heller, A Tight Lower Bound onAdaptively Secure Full-Information Coin Flip, 2020.

 

 

Nir Bitansky and Omri Shmueli, Post-Quantum Zero Knowledge in Constant Rounds, STOC 2020.

 

 

Nir Bitansky and Nathan Geier, On Oblivious Amplification of Coin-Tossing Protocols. 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) ,2020.

 

 

Nir Bitansky and Idan Gerichter. On the Cryptographic Hardness of Local Search. ITCS 2020.

 

 

Mathy Vanhoef, Eyal Ronen. Dragonblood: Analyzing the Dragonfly Handshake of WPA3 and EAP-pwd,Cryptology ePrint Archive: Report 2019/383,2019 (To appear in the IEEE Symposium on Security & Privacy) May 2020.

 

 

Yehuda Afek, Anat Bremler-Barr, David Hay, Ran Goldschmidt, Lior Shafir, Gafnit Avraham, Avraham Shalev, NFV-based IoT Security for Home Networks usingMUD, 2020.

 

 

Yehuda Afek, Lior Shafir, Anat Bremler-Barr, NXNSAttack: Recursive DNS Inefficiencies and Vulnerabilities, 2020

 

 

Avishai Wool, Nimrod Gilboa Markevich, Hardware fingerprinting for the ARINC 429 avionic bus, 2020.

 


Benny Applebaum and Amos Beimel and Oded Nir and Naty Peter, Better Secret-Sharing via Robust Conditional Disclosure of Secret, STOC, 2020
 

 


Benny Applebaum and Zvika Brakerski and Sanjam Garg and Yuval Ishai and Akshayaram Srinivasan, Separating Two-Round Secure Computation From Oblivious Transfer, ITCS, 2020

 

 

Hadas Chassidim, Christos Perentis, Eran Toch & Bruno Lepri, Between privacy and security: the factors that drive intentions to use cyber-security applications, 2020

 

 

2019

 

 

Itay Berman, Iftach Haitner, Eliad Tsfadia, A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments, 2019.

 

 

Eli Biham, Sara Bitan, Aviad Carmel, Alon Dankner, Uriel Malin and Avishai Wool, Rogue7: Rogue engineering-station attacks on S7 Simatic PLCs,  In Black Hat Briefings, Las Vegas, August 2019.

 

 

Adi Shamir, Itay Safran, Eyal Ronen, Orr Dunkelman. A Simple Explanation for the Existence of Adversarial Examples with Small Hamming Distance, 2019.

 

 

Eyal Ronen, Robert Gillham, Daniel Genkin, Adi Shamir, David Wong, Yuval Yarom. The 9 Lives of Bleichenbacher’s CAT:New Cache ATtacks on TLS Implementations.IEEE Symposium on Security and Privacy (SP),Volume: 1,

(Pages: 435-452), Real world Cryptology ePrint, 2019.

 

 

Moni Naor, Benny Pinkas, Eyal Ronen. How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior Real World Crypto, 2019.

 

 

T. Dagan and A. Wool. Vehicle safe-mode: An after-market proof-of-concept In 7th Embedded Security in Cars (ESCAR USA’19), Ann Arbor, MI, USA, June 2019.

 

 

L. David and A. Wool. PRank: Fast analytical rank estimation via Pareto distributions In 10’th Constructive Side-Channel Analysis and Secure Design (COSADE’19), LNCS 11421, (pages 168–190), Germany, April 2019.

 

 

L. David and A. Wool. Poly-logarithmic side channel rank estimation via exponential sampling In Proc. RSA Conference Cryptographers Track (CT-RSA’19), LNCS 11405, (pages 330–349), San Francisco, March 2019.

 

 

Ran Canetti, Alley Stoughton, Mayank Varia. EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security . IACR Cryptology ePrint Archive, 2019.

 

 

Nir Bitansky, Akshay Degwekar. On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations,TCC 2019: Theory of Cryptography (pp 422-450), 2019.

 

 

Nir Bitansky, Iftach Haitner, Ilan Komargodski, and Eylon Yogev. Distributional collision resistance beyond one-way functions. In Advances in Cryptology – EUROCRYPT 2019 – 38th Annual International Conference on the

Theory and Applications of Cryptographic Tech- niques, Germany, Proceedings, Part III, (pages 667_695), 2019 .

 

 

Nir Bitansky, Dakshita Khurana, and Omer Paneth. Weak zero-knowledge beyond the black box barrier. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (pages 1091-1102), STOC 2019.

 

 

Nir Bitansky and Omer Paneth. On round optimal statistical zero knowledge arguments. In CRYPTO 2018 – 38th Annual Cryptology Conference, Proceedings, LNCS, 2019.

 

 

Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland and Alex Samorodnitsky. On the Round Complexity of Randomized Byzantine Agreement. 33rd International Symposium on Distributed Computing (pp.

12:1–12:17), 2019.

 

 

Benny Applebaum and Amos Beimel and Oriol Farràs and Oded Nir and Naty Peter Proc. Secret-Sharing Schemes for General and Uniform Access Structures. 38th EUROCRYPT, 2019

 

 

Benny Applebaum and Zvika Brakerski and Rotem Tsabary Proc. Degree 2 is Complete for the Round-Complexity of Malicious MPC. 38th EUROCRYPT, 2019

 

 

Benny Applebaum and Prashant Nalini Vasudevan Proc. Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. 10th ITCS, 2019

 

 

Iftach Haitner, Noam Mazor, Ronen Shaltiel and Jad Silbak. Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.TCC: Theory of Cryptography pp 531-560, 2019

 

 

Benny Applebaum and Eliran Kachlon. Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders. To appear in FOCS, 2019.

 

 

Haitner, I., Mazor, N., Oshman, R., Reingold, O., & Yehudayoff, A. On the communication complexity of key-agreement protocols. In 10th Innovations in Theoretical Computer Science Conference (ITCS). Schloss Dagstuhl-

Leibniz-Zentrum fuer Informatik, 2019.

 

 

L. David and A. Wool. Poly-logarithmic side channel rank estimation via exponential sampling. In Proc. RSA Conference Cryptographers Track (CT-RSA’19), LNCS 11405, pages 330–349, San Francisco, Springer Verlag. Full

technical report available in Cryptology ePrint Archive, Report 2018/867,March 2019.

 

 

L. David and A. Wool. PRank: Fast analytical rank estimation via Pareto distributions. In 10’th Constructive Side-Channel Analysis and Secure Design (COSADE’19), LNCS 11421, (pages 168–190), Darmstat, Germany,  Full

technical report available in Cryptology ePrint Archive, Report 2018/550, April 2019.

 

 

 

2018

 

Eyal Ronen, Kenneth G. Paterson, Adi Shamir. Pseudo Constant Time Implementations of TLS Are Only Pseudo Secure. ACM CCS, 2018.

 

 

Achiya Bar-On, Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir. Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities. CRYPTO, 2018.

 

 

Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir. Tight Bounds on Online Checkpointing Algorithms. ICALP, 2018.

 

 

Eyal Ronen, Colin O’Flynn, Adi Shamir, Achi-Or Weingarten. IoT Goes Nuclear: Creating a Zigbee Chain Reaction. IEEE Security & Privacy, 2018.

 

 

T. Dagan and A. Wool. Woodpecker, a software-only true random generator for the CAN bus. In 16th Embedded Security in Cars (ESCAR’18), Brussels, November 2018.

 

 

C. Markman, A. Wool, and A. A. Cardenas. Temporal phase shifts in SCADA networks.In 4th ACM CCS Workshop on Cyber-Physical Systems Security & Privacy (CPS-SPC), Toronto, ON, Canada, ACM, October 2018.

 

 

B. Lapid and A. Wool. Navigating the Samsung TrustZone with applications to cache-attacks on AES-256 in the Keymaster trustlet.In Proc. 23rd European Symposium on Research in Computer Security (ESORICS), LNCS

11098, (pages 175–196), Barcelona, September 2018.

 

 

D. Fledel and A. Wool. Sliding-window correlation attacks against encryption devices with an unstable clock. In Proc. 25th Conference on Selected Areas in Cryptography (SAC), LNCS 11349, (pages 193–215), Calgary,

August 2018.

 

 

B. Lapid and A. Wool. Cache-attacks on the ARM TrustZone implementations of AES-256 and AES-256-GCM via GPU-based analysis. In Proc. 25th Conference on Selected Areas in Cryptography (SAC), LNCS 11349, (pages

235–256), Calgary, August 2018.

 

 

Nir Bitansky and Huijia Lin. One-message zero knowledge and non-malleable commitments. InTheory of Cryptography – 16th International Conference, TCC 2018, Panaji, India, Proceedings, (Part I, pages 209-234), 2018.

 

 

Nir Bitansky and Vinod Vaikuntanathan. Indistinguishability obfuscation from functional encryption. JACM Journal of the ACM, (65(6):39:1_39:37), 2018.

 

 

Benny Applebaum and Zvika Brakerski and Rotem Tsabary Proc. Perfect Secure Computation in Two Rounds. 16th TCC, 2018

 

 

Benny Applebaum and Barak Arkis Proc. On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. 16th TCC, 2018

 

 

Benny Applebaum, and Thomas Holenstein, and Manoj Mishra, and Ofer Shayevitz Proc. The Communication Complexity of Private Simultaneous Messages, Revisited. 37th EUROCRYPT, 2018.

 

 

Haitner, I., Makriyannis, N., & Omri, E. On the complexity of fair coin flipping. In Theory of Cryptography Conference (pp. 539-562), November, 2018. 

 

 

Haitner, I., Nissim, K., Omri, E., Shaltiel, R., & Silbak, J. Computational Two-Party Correlation. In Electronic Colloquium on Computational Complexity (ECCC) (Vol. 25, p. 71), April, 2018.

 

 

Beimel, A., Haitner, I., Makriyannis, N., & Omri, E. Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling. IEEE 59th Annual Symposium on Foundations of Computer

Science (FOCS) (pp. 838-849). IEEE, 2018. ‏ ‏

 

 

Ben Lapid and Avishai Wool. Cache-attacks on the ARM TrustZone implementations of AES-256 and AES-256-GCM via GPU-based analysis. In Proc. 25th Conference on Selected Areas in Cryptography (SAC), LNCS 11349,

pages 235–256, Calgary, August 2018. Full technical report available in Cryptology ePrint Archive, Report 2018/621.

 

 

Fledel and Avishai Wool. Sliding-window correlation attacks against encryption devices with an unstable clock. In Proc. 25th Conference on Selected Areas in Cryptography (SAC), LNCS 11349, pages 193–215, Calgary,

August 2018. Full technical report available in Cryptology ePrint Archive, Report 2018/317, 2018.

 

 

Ben Lapid and Avishai Wool. Navigating the Samsung TrustZone with applications to cache-attacks on AES-256 in the Keymaster trustlet. In Proc. 23rd European Symposium on Research in Computer Security (ESORICS),

LNCS 11098, pages 175–196, Barcelona, September 2018.

 

 

C. Markman, A. Wool, and A. A. Cardenas. Temporal phase shifts in SCADA networks. In 4th ACM CCS Workshop on Cyber-Physical Systems Security & Privacy (CPS-SPC), Toronto, Canada. ACM. Full technical report

available in arXiv:1808.05068 [cs.CR].October 2018.

 

 

T. Dagan and A. Wool. Woodpecker, a software-only true random generator for the CAN bus. In 16th Embedded Security in Cars (ESCAR’18), Brussels, November 2018.

 

 

Itay Berman, Iftach Haitner, Aris Tentes: Coin Flipping of Any Constant Bias Implies One-Way Functions.J. ACM 65(3), 14:1-14:95, 2018.

 

 

Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak : Computational Two-Party Correlation FOCS Proceedings, 2018. 

 

 

Benny Applebaum, Barak Arkis: Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate. IACR Cryptology ePrint Archive 2018.

 

 

Daniel Genkin, Lev Pachmanov, Eran Tromer, Yuval Yarom : Drive-by Key-Extraction Cache Attacks from Portable Code. IACR Cryptology ePrint Archive: 119, 2018.

 

 

Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum: Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. EUROCRYPT(1): 91-122, 2018.

 

 

Nir Bitansky, Ran Canetti, Sanjam Garg, Justin Holmgren, Abhishek Jain, Huijia Lin, Rafael Pass, Sidharth Telang, Vinod Vaikuntanathan: Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.

SIAM J. Comput. 47(3): 1123-1210, 2018.

 

 

Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff: On the Communication Complexity of Key-Agreement Protocols.. Electronic Colloquium on Computational Complexity (ECCC) 25: 31, 2018.

 

 

Roei Schuster, Vitaly Shmatikov, Eran Tromer: Situational Access Control in the Internet of Things, ACM Conference on Computer and Communications Security (CCS) 2018.

 

 

Iftach Haitner, Nikolaos Makriyannis, Eran Omri: On the Complexity of Fair Coin Flipping. Electronic Colloquium on Computational Complexity (ECCC) 25: 84, 2018.

 

 

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri: Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling FOCS Proceedings, 2018.

 

 

Kyle Hogan, Hoda Maleki, Reza Rahaeimehr, Ran Canetti, Marten van Dijk, Jason Hennessey, Mayank Varia, Haibin Zhang:On the Universally Composable Security of OpenStack. IACR Cryptology ePrint Archive, 2018.

 

 

For Past publications

 

 

Tel Aviv University makes every effort to respect copyright. If you own copyright to the content contained here and / or the use of such content is in your opinion infringing, Contact us as soon as possible >>
Tel Aviv University, P.O. Box 39040, Tel Aviv 6997801, Israel
UI/UX Basch_Interactive