Order-Preserving Encryption Secure Beyond One-Wayness

Malkin Tal , Teranishi Isamu , Yung Moti
IEICE Technical Report; IEICE Tech. Rep. 115 ( 28) 43 -43

2015
A unified framework for the analysis of side-channel key recovery attacks

François-Xavier Standaert , Tal G Malkin , Moti Yung
Advances in Cryptology-EUROCRYPT 2009: 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings 28 443 -461

1,156
2009
Lessons from the Past, Challenges for the Future

François-Xavier Standaert , Tal G Malkin , Moti Yung

2021
Does physical security of cryptographic devices need a formal study?(invited talk)

François-Xavier Standaert , Tal G Malkin , Moti Yung
Information Theoretic Security: Third International Conference, ICITS 2008, Calgary, Canada, August 10-13, 2008. Proceedings 3 70 -70

3
2008
A study of secure database access and general two-party computation

Tal Geula Malkin
Massachusetts Institute of Technology

12
2000
On the Capacity of Secure Network Coding

Jon Feldman , Tal Malkin , Cliff Stein , Rocco A Servedio

228
2004
251
2010
Anonymity in Wireless Broadcast Networks

Angelos D. Keromytis , John Ioannidis , Aviel D. Rubin , Tal Malkin
International Journal of Network Security 8 ( 1) 37 -51

16
2009
The Power of Negations in Cryptography.

Siyao Guo , Tal Malkin , Alon Rosen , Igor Carboni Oliveira
Electronic Colloquium on Computational Complexity 22 8

2015
ProSiBIR: Proactive Signer-Base Intrusion Resilient Signatures.

Tal Malkin , Philip Atzemoglou
IACR Cryptology ePrint Archive 2007 200

2007
Efficient generic forward-secure signatures with an unbounded number of time periods

Daniele Micciancio , Sara Miner , Tal Malkin
Lecture Notes in Computer Science 400 -417

13
2002
Garbled Neural Networks are Practical.

Mike Rosulek , Tal Malkin , Brent Carmer , Marshall Ball
IACR Cryptology ePrint Archive 2019 338

14
2019
Limits to Non-Malleability.

Dana Dachman-Soled , Tal Malkin , Mukul Kulkarni , Marshall Ball
IACR Cryptology ePrint Archive 2019 449

2019
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces.

Dan Rubenstein , Seung Geol Choi , Tal Malkin , Kyung-Wook Hwang
IACR Cryptology ePrint Archive 2011 257

137
2011
Lower bounds for oblivious near-neighbor search

Omri Weinstein , Kasper Green Larsen , Tal Malkin , Kevin Yeo
symposium on discrete algorithms 1116 -1134

2020
Public-Key Function-Private Hidden Vector Encryption (and More).

Alex J. Malozemoff , Tancrède Lepoint , Abhishek Jain , Tal Malkin
IACR Cryptology ePrint Archive 2019 746

2019
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?

Yuval Ishai , Justin Holmgren , Tal Malkin , Tianren Liu
conference on innovations in theoretical computer science 22

2
2020
Garbling Gadgets for Boolean and Arithmetic Circuits.

Mike Rosulek , Tal Malkin , Marshall Ball
IACR Cryptology ePrint Archive 2016 969

1
2016