55 research outputs found
Graph Distillation for Action Detection with Privileged Modalities
We propose a technique that tackles action detection in multimodal videos
under a realistic and challenging condition in which only limited training data
and partially observed modalities are available. Common methods in transfer
learning do not take advantage of the extra modalities potentially available in
the source domain. On the other hand, previous work on multimodal learning only
focuses on a single domain or task and does not handle the modality discrepancy
between training and testing. In this work, we propose a method termed graph
distillation that incorporates rich privileged information from a large-scale
multimodal dataset in the source domain, and improves the learning in the
target domain where training data and modalities are scarce. We evaluate our
approach on action classification and detection tasks in multimodal videos, and
show that our model outperforms the state-of-the-art by a large margin on the
NTU RGB+D and PKU-MMD benchmarks. The code is released at
http://alan.vision/eccv18_graph/.Comment: ECCV 201
Forecasting Human-Object Interaction: Joint Prediction of Motor Attention and Actions in First Person Video
We address the challenging task of anticipating human-object interaction in
first person videos. Most existing methods ignore how the camera wearer
interacts with the objects, or simply consider body motion as a separate
modality. In contrast, we observe that the international hand movement reveals
critical information about the future activity. Motivated by this, we adopt
intentional hand movement as a future representation and propose a novel deep
network that jointly models and predicts the egocentric hand motion,
interaction hotspots and future action. Specifically, we consider the future
hand motion as the motor attention, and model this attention using latent
variables in our deep model. The predicted motor attention is further used to
characterise the discriminative spatial-temporal visual features for predicting
actions and interaction hotspots. We present extensive experiments
demonstrating the benefit of the proposed joint model. Importantly, our model
produces new state-of-the-art results for action anticipation on both EGTEA
Gaze+ and the EPIC-Kitchens datasets. Our project page is available at
https://aptx4869lm.github.io/ForecastingHOI
Key Rotation for Authenticated Encryption
A common requirement in practice is to periodically rotate the keys used to
encrypt stored data. Systems used by Amazon and Google do so using a hybrid
encryption technique which is eminently practical but has questionable
security in the face of key compromises and does not provide full key
rotation. Meanwhile, symmetric updatable encryption schemes (introduced by
Boneh et al. CRYPTO 2013) support full key rotation without performing
decryption: ciphertexts created under one key can be rotated to ciphertexts
created under a different key with the help of a re-encryption token. By
design, the tokens do not leak information about keys or plaintexts and so
can be given to storage providers without compromising security. But the
prior work of Boneh et al. addresses relatively weak confidentiality goals
and does not consider integrity at all. Moreover, as we show, a subtle issue
with their concrete scheme obviates a security proof even for confidentiality
against passive attacks.
This paper presents a systematic study of updatable Authenticated Encryption
(AE). We provide a set of security notions that strengthen those in prior
work. These notions enable us to tease out real-world security requirements
of different strengths and build schemes that satisfy them efficiently. We
show that the hybrid approach currently used in industry achieves relatively
weak forms of confidentiality and integrity, but can be modified at low cost
to meet our stronger confidentiality and integrity goals. This leads to a
practical scheme that has negligible overhead beyond conventional AE. We then
introduce re-encryption indistinguishability, a security notion that formally
captures the idea of fully refreshing keys upon rotation. We show how to
repair the scheme of Boneh et al., attaining our stronger confidentiality
notion. We also show how to extend the scheme to provide integrity, and we
prove that it meets our re- encryption indistinguishability notion. Finally,
we discuss how to instantiate our scheme efficiently using off-the-shelf
cryptographic components (AE, hashing, elliptic curves). We report on the
performance of a prototype implementation, showing that fully secure key
rotations can be performed at a throughput of approximately 116 kB/s
Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
In this work we separate private-key semantic security from circular security using the Learning with Error assumption. Prior works used the less standard assumptions of multilinear maps or indistinguishability obfuscation. To achieve our results we develop new techniques for obliviously evaluating branching programs
A 3D Human Posture Approach for Activity Recognition Based on Depth Camera
Human activity recognition plays an important role in the context of Ambient Assisted Living (AAL), providing useful tools to improve people quality of life. This work presents an activity recognition algorithm based on the extraction of skeleton joints from a depth camera. The system describes an activity using a set of few and basic postures extracted by means of the X-means clustering algorithm. A multi-class Support Vector Machine, trained with the Sequential Minimal Optimization is employed to perform the classification. The system is evaluated on two public datasets for activity recognition which have different skeleton models, the CAD-60 with 15 joints and the TST with 25 joints. The proposed approach achieves precision/recall performances of 99.8 % on CAD-60 and 97.2 %/91.7 % on TST. The results are promising for an applied use in the context of AAL
Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
A public key encryption scheme is said to be n-circular secure if no PPT adversary can distinguish between encryptions of an n length key cycle and n encryptions of zero.
One interesting question is whether circular security comes for free from IND-CPA security. Recent works have addressed this question, showing that for all integers n, there exists an IND-CPA scheme that is not n-circular secure. However, this leaves open the possibility that for every IND-CPA cryptosystem, there exists a cycle length l, dependent on the cryptosystem (and the security parameter) such that the scheme is l-circular secure. If this is true, then this would directly lead to many applications, in particular, it would give us a fully homomorphic encryption scheme via Gentry’s bootstrapping.
In this work, we show that is not true. Assuming indistinguishability obfuscation and leveled homomorphic encryption, we construct an IND-CPA scheme such that for all cycle lengths l, the scheme is not l-circular secure
Circular Security Is Complete for KDM Security
Circular security is the most elementary form of key-dependent message (KDM) security, which allows us to securely encrypt only a copy of secret key bits. In this work, we show that circular security is complete for KDM security in the sense that an encryption scheme satisfying this security notion can be transformed into one satisfying KDM security with respect to all functions computable by a-priori bounded-size circuits (bounded-KDM security). This result holds in the presence of any number of keys and in any of secret-key/public-key and CPA/CCA settings. Such a completeness result was previously shown by Applebaum (EUROCRYPT 2011) for KDM security with respect to projection functions (projection-KDM security) that allows us to securely encrypt both a copy and a negation of secret key bits.
Besides amplifying the strength of KDM security, our transformation in fact can start from an encryption scheme satisfying circular security against CPA attacks and results in one satisfying bounded-KDM security against CCA attacks.
This result improves the recent result by Kitagawa and Matsuda (TCC 2019) showing a CPA-to-CCA transformation for KDM secure public-key encryption schemes
Chosen Ciphertext Security from Injective Trapdoor Functions
We provide a construction of chosen ciphertext secure public-key encryption from (injective) trapdoor functions. Our construction is black box and assumes no special properties (e.g. ``lossy\u27\u27, ``correlated product secure\u27\u27) of the trapdoor function
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes
Abstract. We propose generic constructions of public-key encryption schemes, satisfying key- dependent message (KDM) security for projections and different forms of key-leakage resilience, from CPA-secure private key encryption schemes with two main abstract properties: (1) additive homomorphism with respect to both messages and randomness, and (2) reproducibility, providing a means for reusing encryption randomness across independent secret keys. More precisely, our construction transforms a private-key scheme with the stated properties (and one more mild condition) into a public-key one, providing:
- n-KDM-projection security, an extension of circular security, where the adversary may also ask for encryptions of negated secret key bits;
– a (1-o(1)) resilience rate in the bounded-memory leakage model of Akavia et al. (TCC 2009); and
– Auxiliary-input security against subexponentially-hard functions.
We introduce homomorphic weak pseudorandom functions, a homomorphic version of the weak PRFs proposed by Naor and Reingold (FOCS ’95) and use them to realize our base encryption scheme. We obtain homomorphic weak PRFs under assumptions including subgroup indistinguishability (implied, in particular, by QR and DCR) and homomorphic hash-proof systems (HHPS). As corollaries of our results, we obtain (1) a projection-secure encryption scheme (as well as a scheme with a (1-o(1)) resilience rate) based solely on the HHPS assumption, and (2) a unifying approach explaining the results of Boneh et al (CRYPTO ’08) and Brakerski and Goldwasser (CRYPTO ’10). Finally, by observing that Applebaum’s KDM amplification method (EUROCRYPT ’11) preserves both types of leakage resilience, we obtain schemes providing at the same time high leakage resilience and KDM security against any fixed polynomial-sized circuit family
Spontaneous pneumomediastinum, pneumothorax, pneumorrhachis, pneumoretroperitoneum, surgical emphysemaAdult cervical lung herniation: Importance of valsalva manoeuvre in imaging
- …