Search

Your search keyword '"Malkin, Tal"' showing total 553 results
Start Over Author "Malkin, Tal"

Refine your results

more »

more »

more »

more »
553 results on '"Malkin, Tal"'

3. Lower Bounds for Oblivious Near-Neighbor Search

Author

Larsen, Kasper Green, Malkin, Tal, Weinstein, Omri, and Yeo, Kevin

Subjects
Computer Science - Data Structures and Algorithms, Computer Science - Cryptography and Security
Abstract

We prove an $\Omega(d \lg n/ (\lg\lg n)^2)$ lower bound on the dynamic cell-probe complexity of statistically $\mathit{oblivious}$ approximate-near-neighbor search ($\mathsf{ANN}$) over the $d$-dimensional Hamming cube. For the natural setting of $d = \Theta(\log n)$, our result implies an $\tilde{\Omega}(\lg^2 n)$ lower bound, which is a quadratic improvement over the highest (non-oblivious) cell-probe lower bound for $\mathsf{ANN}$. This is the first super-logarithmic $\mathit{unconditional}$ lower bound for $\mathsf{ANN}$ against general (non black-box) data structures. We also show that any oblivious $\mathit{static}$ data structure for decomposable search problems (like $\mathsf{ANN}$) can be obliviously dynamized with $O(\log n)$ overhead in update and query time, strengthening a classic result of Bentley and Saxe (Algorithmica, 1980)., Comment: 28 pages

Published
2019

4. Two Party Distribution Testing: Communication and Security

Author

Andoni, Alexandr, Malkin, Tal, and Nosatzki, Negev Shekel

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We study the problem of discrete distribution testing in the two-party setting. For example, in the standard closeness testing problem, Alice and Bob each have $t$ samples from, respectively, distributions $a$ and $b$ over $[n]$, and they need to test whether $a=b$ or $a,b$ are $\epsilon$-far for some fixed $\epsilon>0$. This is in contrast to the well-studied one-party case, where the tester has unrestricted access to samples of both distributions, for which optimal bounds are known for a number of variations. Despite being a natural constraint in applications, the two-party setting has evaded attention so far. We address two fundamental aspects: 1) what is the communication complexity, and 2) can it be accomplished securely, without Alice and Bob learning extra information about each other's input. Besides closeness testing, we also study the independence testing problem, where Alice and Bob have $t$ samples from distributions $a$ and $b$ respectively, which may be correlated; the question is whether $a,b$ are independent of $\epsilon$-far from being independent. Our contribution is three-fold: 1) Communication: we show how to gain communication efficiency with more samples, beyond the information-theoretic bound on $t$. The gain is polynomially better than what one obtains by adapting standard algorithms. 2) Lower bounds: we prove tightness of our protocols for the closeness testing, and for the independence testing when the number of samples is unbounded. These lower bounds are of independent interest as these are the first 2-party communication lower bounds for testing problems. 3) Security: we define secure distribution testing and argue that it must leak at least some minimal information. We then provide secure versions of the above protocols with an overhead that is only polynomial in the security parameter.

Published
2018

5. Poly Onions: Achieving Anonymity in the Presence of Churn

Author

Ando, Megumi, Christ, Miranda, Lysyanskaya, Anna, Malkin, Tal, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Kiltz, Eike, editor, and Vaikuntanathan, Vinod, editor

Published
2022
Full Text
View/download PDF

6. XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE

Author

Lin, Chengyu, Liu, Zeyu, Malkin, Tal, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Atluri, Vijayalakshmi, editor, Di Pietro, Roberto, editor, Jensen, Christian D., editor, and Meng, Weizhi, editor

Published
2022
Full Text
View/download PDF

7. Unclonable Polymers and Their Cryptographic Applications

Author

Almashaqbeh, Ghada, Canetti, Ran, Erlich, Yaniv, Gershoni, Jonathan, Malkin, Tal, Pe’er, Itsik, Roitburd-Berman, Anna, Tromer, Eran, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Dunkelman, Orr, editor, and Dziembowski, Stefan, editor

Published
2022
Full Text
View/download PDF

8. Non-Malleable Codes for Small-Depth Circuits

Author

Ball, Marshall, Dachman-Soled, Dana, Guo, Siyao, Malkin, Tal, and Tan, Li-Yang

Subjects
Computer Science - Computational Complexity, Computer Science - Cryptography and Security, Computer Science - Information Theory
Abstract

We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by small-depth circuits. For constant-depth circuits of polynomial size (i.e. $\mathsf{AC^0}$ tampering functions), our codes have codeword length $n = k^{1+o(1)}$ for a $k$-bit message. This is an exponential improvement of the previous best construction due to Chattopadhyay and Li (STOC 2017), which had codeword length $2^{O(\sqrt{k})}$. Our construction remains efficient for circuit depths as large as $\Theta(\log(n)/\log\log(n))$ (indeed, our codeword length remains $n\leq k^{1+\epsilon})$, and extending our result beyond this would require separating $\mathsf{P}$ from $\mathsf{NC^1}$. We obtain our codes via a new efficient non-malleable reduction from small-depth tampering to split-state tampering. A novel aspect of our work is the incorporation of techniques from unconditional derandomization into the framework of non-malleable reductions. In particular, a key ingredient in our analysis is a recent pseudorandom switching lemma of Trevisan and Xue (CCC 2013), a derandomization of the influential switching lemma from circuit complexity; the randomness-efficiency of this switching lemma translates into the rate-efficiency of our codes via our non-malleable reduction., Comment: 26 pages, 4 figures

Published
2018

9. Topology-Hiding Communication from Minimal Assumptions

Author

Ball, Marshall, Boyle, Elette, Cohen, Ran, Kohl, Lisa, Malkin, Tal, Meyer, Pierre, Moran, Tal, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Pass, Rafael, editor, and Pietrzak, Krzysztof, editor

Published
2020
Full Text
View/download PDF

10. Non-malleability Against Polynomial Tampering

Author

Ball, Marshall, Chattopadhyay, Eshan, Liao, Jyun-Jie, Malkin, Tal, Tan, Li-Yang, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Micciancio, Daniele, editor, and Ristenpart, Thomas, editor

Published
2020
Full Text
View/download PDF

11. Strong Hardness of Privacy from Weak Traitor Tracing

Author

Kowalczyk, Lucas, Malkin, Tal, Ullman, Jonathan, and Zhandry, Mark

Subjects
Computer Science - Cryptography and Security, Computer Science - Data Structures and Algorithms
Abstract

Despite much study, the computational complexity of differential privacy remains poorly understood. In this paper we consider the computational complexity of accurately answering a family $Q$ of statistical queries over a data universe $X$ under differential privacy. A statistical query on a dataset $D \in X^n$ asks "what fraction of the elements of $D$ satisfy a given predicate $p$ on $X$?" Dwork et al. (STOC'09) and Boneh and Zhandry (CRYPTO'14) showed that if both $Q$ and $X$ are of polynomial size, then there is an efficient differentially private algorithm that accurately answers all the queries, and if both $Q$ and $X$ are exponential size, then under a plausible assumption, no efficient algorithm exists. We show that, under the same assumption, if either the number of queries or the data universe is of exponential size, and the other has size at least $\tilde{O}(n^7)$, then there is no differentially private algorithm that answers all the queries. In both cases, the result is nearly quantitatively tight, since there is an efficient differentially private algorithm that answers $\tilde{\Omega}(n^2)$ queries on an exponential size data universe, and one that answers exponentially many queries on a data universe of size $\tilde{\Omega}(n^2)$. Our proofs build on the connection between hardness results in differential privacy and traitor-tracing schemes (Dwork et al., STOC'09; Ullman, STOC'13). We prove our hardness result for a polynomial size query set (resp., data universe) by showing that they follow from the existence of a special type of traitor-tracing scheme with very short ciphertexts (resp., secret keys), but very weak security guarantees, and then constructing such a scheme.

Published
2016

15. Is Information-Theoretic Topology-Hiding Computation Possible?

Author

Ball, Marshall, Boyle, Elette, Cohen, Ran, Malkin, Tal, Moran, Tal, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hofheinz, Dennis, editor, and Rosen, Alon, editor

Published
2019
Full Text
View/download PDF

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

Author

Bartusek, James, Carmer, Brent, Jain, Abhishek, Jin, Zhengzhong, Lepoint, Tancrède, Ma, Fermi, Malkin, Tal, Malozemoff, Alex J., Raykova, Mariana, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Galbraith, Steven D., editor, and Moriai, Shiho, editor

Published
2019
Full Text
View/download PDF

17. Non-Malleable Codes Against Bounded Polynomial Time Tampering

Author

Ball, Marshall, Dachman-Soled, Dana, Kulkarni, Mukul, Lin, Huijia, Malkin, Tal, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Ishai, Yuval, editor, and Rijmen, Vincent, editor

Published
2019
Full Text
View/download PDF

18. Mitigating the One-Use Restriction in Attribute-Based Encryption

Author

Kowalczyk, Lucas, Liu, Jiahui, Malkin, Tal, Meiyappan, Kailash, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, and Lee, Kwangsu, editor

Published
2019
Full Text
View/download PDF

19. Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation

Author

Kang, Yuan, Lin, Chengyu, Malkin, Tal, Raykova, Mariana, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Catalano, Dario, editor, and De Prisco, Roberto, editor

Published
2018
Full Text
View/download PDF

20. Hardness of Non-interactive Differential Privacy from One-Way Functions

Author

Kowalczyk, Lucas, Malkin, Tal, Ullman, Jonathan, Wichs, Daniel, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Shacham, Hovav, editor, and Boldyreva, Alexandra, editor

Published
2018
Full Text
View/download PDF

21. A Simple Obfuscation Scheme for Pattern-Matching with Wildcards

Author

Bishop, Allison, Kowalczyk, Lucas, Malkin, Tal, Pastro, Valerio, Raykova, Mariana, Shi, Kevin, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Shacham, Hovav, editor, and Boldyreva, Alexandra, editor

Published
2018
Full Text
View/download PDF

22. Non-malleable Codes from Average-Case Hardness: , Decision Trees, and Streaming Space-Bounded Tampering

Author

Ball, Marshall, Dachman-Soled, Dana, Kulkarni, Mukul, Malkin, Tal, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Nielsen, Jesper Buus, editor, and Rijmen, Vincent, editor

Published
2018
Full Text
View/download PDF

23. Exploring the Boundaries of Topology-Hiding Computation

Author

Ball, Marshall, Boyle, Elette, Malkin, Tal, Moran, Tal, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Nielsen, Jesper Buus, editor, and Rijmen, Vincent, editor

Published
2018
Full Text
View/download PDF

27. Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits

Author

Ball, Marshall, Dachman-Soled, Dana, Kulkarni, Mukul, Malkin, Tal, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Fischlin, Marc, editor, and Coron, Jean-Sébastien, editor

Published
2016
Full Text
View/download PDF

30. The Power of Negations in Cryptography

Author

Guo, Siyao, Malkin, Tal, Oliveira, Igor C., Rosen, Alon, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Dodis, Yevgeniy, editor, and Nielsen, Jesper Buus, editor

Published
2015
Full Text
View/download PDF

34. A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication

Author

Gertner, Yael, Goldwasser, Shafi, Malkin, Tal, Gertner, Yael, Goldwasser, Shafi, and Malkin, Tal

Abstract

Private information retrieval (PIR) schemes provide a user with information from a database while keeping his query secret from the database manager. We propose a new model for PIR, utilizing auxiliary random servers providing privacy services for databas

Published
2023

35. Order-Preserving Encryption Secure Beyond One-Wayness

Author

Teranishi, Isamu, Yung, Moti, Malkin, Tal, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Sarkar, Palash, editor, and Iwata, Tetsu, editor

Published
2014
Full Text
View/download PDF

36. Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?

Author

Dachman-Soled, Dana, Mahmoody, Mohammad, Malkin, Tal, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Lindell, Yehuda, editor

Published
2014
Full Text
View/download PDF

39. Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments

Author

Dachman-Soled, Dana, Malkin, Tal, Raykova, Mariana, Venkitasubramaniam, Muthuramakrishnan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sako, Kazue, editor, and Sarkar, Palash, editor

Published
2013
Full Text
View/download PDF

40. Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction

Author

Gordon, S. Dov, Malkin, Tal, Rosulek, Mike, Wee, Hoeteck, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Johansson, Thomas, editor, and Nguyen, Phong Q., editor

Published
2013
Full Text
View/download PDF

41. Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time

Author

Shi, Elaine, Aqeel, Waqar, Chandrasekaran, Balakrishnan, Maggs, Bruce, Malkin, Tal, Peikert, Chris, Computer Systems, Network Institute, Malkin, Tal, and Peikert, Chris

Subjects
Pseudorandom number generator, Software deployment, business.industry, Computer science, Computation, Server, Bandwidth (computing), InformationSystems_DATABASEMANAGEMENT, business, Private information retrieval, Computer network
Abstract

Imagine one or more non-colluding servers each holding a large public database, e.g., the repository of DNS entries. Clients would like to access entries in this database without disclosing their queries to the servers. Classical private information retrieval (PIR) schemes achieve polylogarithmic bandwidth per query, but require the server to perform linear computation per query, which is a significant barrier towards deployment. Several recent works showed, however, that by introducing a one-time, per-client, off-line preprocessing phase, an unbounded number of client queries can be subsequently served with sublinear online computation time per query (and the cost of the preprocessing can be amortized over the unboundedly many queries). Existing preprocessing PIR schemes (supporting unbounded queries), unfortunately, make undesirable tradeoffs to achieve sublinear online computation: they are either significantly non-optimal in online time or bandwidth, or require the servers to store a linear amount of state per client or even per query, or require polylogarithmically many non-colluding servers. We propose a novel 2-server preprocessing PIR scheme that achieves O~(n) online computation per query and O~(n) client storage, while preserving the polylogarithmic online bandwidth of classical PIR schemes. Both the online bandwidth and computation are optimal up to a poly-logarithmic factor. In our construction, each server stores only the original database and nothing extra, and each online query is served within a single round trip. Our construction relies on the standard LWE assumption. As an important stepping stone, we propose new, more generalized definitions for a cryptographic object called a Privately Puncturable Pseudorandom Set, and give novel constructions that depart significantly from prior approaches.

Published
2021

42. Computational Extractors and Pseudorandomness

Author

Dachman-Soled, Dana, Gennaro, Rosario, Krawczyk, Hugo, Malkin, Tal, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Cramer, Ronald, editor

Published
2012
Full Text
View/download PDF

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

Author

Choi, Seung Geol, Hwang, Kyung-Wook, Katz, Jonathan, Malkin, Tal, Rubenstein, Dan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Dunkelman, Orr, editor

Published
2012
Full Text
View/download PDF

44. BiTR: Built-in Tamper Resilience

Author

Choi, Seung Geol, Kiayias, Aggelos, Malkin, Tal, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Lee, Dong Hoon, editor, and Wang, Xiaoyun, editor

Published
2011
Full Text
View/download PDF

45. Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications

Author

Dachman-Soled, Dana, Malkin, Tal, Raykova, Mariana, Yung, Moti, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Lopez, Javier, editor, and Tsudik, Gene, editor

Published
2011
Full Text
View/download PDF

46. Efficient Circuit-Size Independent Public Key Encryption with KDM Security

Author

Malkin, Tal, Teranishi, Isamu, Yung, Moti, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Paterson, Kenneth G., editor

Published
2011
Full Text
View/download PDF

47. On the Black-Box Complexity of Optimally-Fair Coin Tossing

Author

Dachman-Soled, Dana, Lindell, Yehuda, Mahmoody, Mohammad, Malkin, Tal, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Ishai, Yuval, editor

Published
2011
Full Text
View/download PDF

48. Signatures Resilient to Continual Leakage on Memory and Computation

Author

Malkin, Tal, Teranishi, Isamu, Vahlis, Yevgeniy, Yung, Moti, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Ishai, Yuval, editor

Published
2011
Full Text
View/download PDF

49. Secure Multi-party Computation Minimizing Online Rounds

Author

Choi, Seung Geol, Elbaz, Ariel, Malkin, Tal, Yung, Moti, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Matsui, Mitsuru, editor

Published
2009
Full Text
View/download PDF

50. Improved Non-committing Encryption with Applications to Adaptively Secure Protocols

Author

Choi, Seung Geol, Dachman-Soled, Dana, Malkin, Tal, Wee, Hoeteck, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Matsui, Mitsuru, editor

Published
2009
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results