SwePub - sökning: L773:1556 6013 OR L773:1556 60...

Numrering	Referens	Omslagsbild	Hitta
1.	Alam, Quratulain, et al. (författare) Formal Verification of the xDAuth Protocol 2016 Ingår i: IEEE Transactions on Information Forensics and Security. - 1556-6013 .- 1556-6021. ; 11:9, s. 1956-1969 Tidskriftsartikel (refereegranskat)abstract Service Oriented Architecture (SOA) offers a flexible paradigm for information flow among collaborating organizations. As information moves out of an organization boundary, various security concerns may arise, such as confidentiality, integrity, and authenticity that needs to be addressed. Moreover, verifying the correctness of the communication protocol is also an important factor. This paper focuses on the formal verification of the xDAuth protocol, which is one of the prominent protocols for identity management in cross domain scenarios. We have modeled the information flow of xDAuth protocol using High Level Petri Nets (HLPN) to understand protocol information flow in a distributed environment. We analyze the rules of information flow using Z language while Z3 SMT solver is used for verification of the model. Our formal analysis and verification results reveal the fact that the protocol fulfills its intended purpose and provides the security for the defined protocol specific properties, e.g. secure secret key authentication, Chinese wall security policy and secrecy specific properties, e.g. confidentiality, integrity, authenticity.
2.	Alonso-Fernandez, Fernando, 1978-, et al. (författare) A Comparative Study of Fingerprint Image-Quality Estimation Methods 2007 Ingår i: IEEE Transactions on Information Forensics and Security. - New York : IEEE Press. - 1556-6013 .- 1556-6021. ; 2:4, s. 734-743 Tidskriftsartikel (refereegranskat)abstract One of the open issues in fingerprint verification is the lack of robustness against image-quality degradation. Poor-quality images result in spurious and missing features, thus degrading the performance of the overall system. Therefore, it is important for a fingerprint recognition system to estimate the quality and validity of the captured fingerprint images. In this work, we review existing approaches for fingerprint image-quality estimation, including the rationale behind the published measures and visual examples showing their behavior under different quality conditions. We have also tested a selection of fingerprint image-quality estimation algorithms. For the experiments, we employ the BioSec multimodal baseline corpus, which includes 19 200 fingerprint images from 200 individuals acquired in two sessions with three different sensors. The behavior of the selected quality measures is compared, showing high correlation between them in most cases. The effect of low-quality samples in the verification performance is also studied for a widely available minutiae-based fingerprint matching system.
3.	Bhanu, Bir, et al. (författare) Guest Editorial : Special Issue on Human Detection and Recognition 2007 Ingår i: IEEE Transactions on Information Forensics and Security. - New York : IEEE Press. - 1556-6013 .- 1556-6021. ; 2:3 part 2, s. 489-490 Tidskriftsartikel (refereegranskat)abstract The 12 regular papers and three correspondences in this special issue focus on human detection and recognition. The papers represent gait, face (3-D, 2-D, video), iris, palmprint, cardiac sounds, and vulnerability of biometrics and protection against the spoof attacks.
4.	Borhani, Mohammad, 1993-, et al. (författare) KDC Placement Problem in Secure VPLS Networks 2023 Ingår i: IEEE Transactions on Information Forensics and Security. - : IEEE. - 1556-6013 .- 1556-6021. ; 18, s. 1951-1962 Tidskriftsartikel (refereegranskat)abstract Virtual Private LAN Service (VPLS) is a VPN technology that connects remote client sites with provider networks in a transparent manner. Session key-based HIPLS (S-HIPLS) is a VPLS architecture based on the Host Identity Protocol (HIP) that provides a secure VPLS architecture using a Key Distribution Center (KDC) to implement security mechanisms such as authentication, encryption etc. It exhibits limited scalability though. Using multiple distributed KDCs would offer numerous advantages including reduced workload per KDC, distributed key storage, and improved scalability, while simultaneously eliminating the single point of failure of S-HIPLS. It would also come with the need for optimally placing KDCs in the provider network. In this work, we formulate the KDC placement (KDCP) problem for a secure VPLS network as an Integer Linear Programming (ILP) problem. The latter is NP-hard, thereby suggesting a high computational cost for obtaining exact solutions especially for large deployments. Therefore, we motivate the use of a primal-dual algorithm to efficiently produce near-optimal solutions. Extensive evaluations on large-scale network topologies, such as the random Internet graph, demonstrate our method’s time-efficiency as well as its improved scalability and usefulness compared to both HIPLS and S-HIPLS.
5.	Cao, Phuong, et al. (författare) Optimal Transmit Strategies for Gaussian MISO Wiretap Channels 2018 Ingår i: IEEE Transactions on Information Forensics and Security. - 1556-6013 .- 1556-6021. Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract This paper studies the optimal tradeoff between secrecy and non-secrecy rates of the MISO wiretap channels for different power constraint settings:sum power constraint only, per-antenna power constraints only and joint sum and per-antenna power constraints. The problem is motivated by the fact thatchannel capacity and secrecy capacity are generally achieved by different transmit strategies. First, a necessary and sufficient condition to ensure a positive secrecy capacity is shown. The optimal tradeoff between secrecy rate and transmission rate is characterized by a weighted rate sum maximization problem. Since this problem is not necessarily convex, equivalent problem formulations are introduced to derive the optimal transmit strategies. Under sum power constraint only, a closed-form solution is provided. Under per-antenna power constraints, necessary conditions to find the optimal power allocation are provided. Sufficient conditions are provided for the special case of two transmit antennas. For the special case of parallel channels, the optimal transmit strategies can deduced from an equivalent point-to-point channel problem. Lastly, the theoretical results are illustrated by numerical simulations.
6.	Cao, Phuong, et al. (författare) Optimal Transmit Strategies for Gaussian MISO Wiretap Channels 2020 Ingår i: IEEE Transactions on Information Forensics and Security. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1556-6013 .- 1556-6021. ; 15, s. 829-838 Tidskriftsartikel (refereegranskat)abstract This paper studies the optimal tradeoff between secrecy and non-secrecy rates of the MISO wiretap channels for different power constraint settings: sum power constraint only, per-antenna power constraints only, and joint sum and per-antenna power constraints. The problem is motivated by the fact that channel capacity and secrecy capacity are generally achieved by different transmit strategies. First, a necessary and sufficient condition to ensure a positive secrecy capacity is shown. The optimal tradeoff between secrecy rate and transmission rate is characterized by a weighted rate sum maximization problem. Since this problem is not necessarily convex, equivalent problem formulations are introduced to derive the optimal transmit strategies. Under sum power constraint only, a closed-form solution is provided. Under per-antenna power constraints, necessary conditions to find the optimal power allocation are derived. Sufficient conditions are provided for the special case of two transmit antennas. For the special case of aligned channels, the optimal transmit strategies can deduced from an equivalent point-to-point channel problem. Last, the theoretical results are illustrated by numerical simulations.
7.	Chen, Guang, et al. (författare) NeuroAED : Towards Efficient Abnormal Event Detection in Visual Surveillance With Neuromorphic Vision Sensor 2021 Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 16, s. 923-936 Tidskriftsartikel (refereegranskat)abstract Abnormal event detection is an important task in research and industrial applications, which has received considerable attention in recent years. Existing methods usually rely on standard frame-based cameras to record the data and process them with computer vision technologies. In contrast, this paper presents a novel neuromorphic vision based abnormal event detection system. Compared to the frame-based camera, neuromorphic vision sensors, such as Dynamic Vision Sensor (DVS), do not acquire full images at a fixed frame rate but rather have independent pixels that output intensity changes (called events) asynchronously at the time they occur. Thus, it avoids the design of the encryption scheme. Since events are triggered by moving edges on the scene, DVS is a natural motion detector for the abnormal objects and automatically filters out any temporally-redundant information. Based on this unique output, we first propose a highly efficient method based on the event density to select activated event cuboids and locate the foreground. We design a novel event-based multiscale spatio-temporal descriptor to extract features from the activated event cuboids for the abnormal event detection. Additionally, we build the NeuroAED dataset, the first public dataset dedicated to abnormal event detection with neuromorphic vision sensor. The NeuroAED dataset consists of four sub-datasets: Walking, Campus, Square, and Stair dataset. Experiments are conducted based on these datasets and demonstrate the high efficiency and accuracy of our method.
8.	Choraria, Moulik, et al. (författare) Design of false data injection attack on distributed process estimation 2022 Ingår i: IEEE Transactions on Information Forensics and Security. - 1556-6021 .- 1556-6013. ; 17, s. 670-683 Tidskriftsartikel (refereegranskat)abstract Herein, design of false data injection attack on a distributed cyber-physical system is considered. A stochastic process with linear dynamics and Gaussian noise is measured by multiple agent nodes, each equipped with multiple sensors. The agent nodes form a multi-hop network among themselves. Each agent node computes an estimate of the process by using its sensor observation and messages obtained from neighboring nodes, via Kalman-consensus filtering. An external attacker, capable of arbitrarily manipulating the sensor observations of some or all agent nodes, injects errors into those sensor observations. The goal of the attacker is to steer the estimates at the agent nodes as close as possible to a pre-specified value, while respecting a constraint on the attack detection probability. To this end, a constrained optimization problem is formulated to find the optimal parameter values of a certain class of linear attacks. The parameters of linear attack are learnt on-line via a combination of stochastic approximation based update of a Lagrange multiplier, and an optimization technique involving either the Karush-Kuhn-Tucker (KKT) conditions or online stochastic gradient descent. The problem turns out to be convex for some special cases. Desired convergence of the proposed algorithms are proved by exploiting the convexity and properties of stochastic approximation algorithms. Finally, numerical results demonstrate the efficacy of the attack.
9.	Do, Tan Tai, et al. (författare) Jamming-Resistant Receivers for the Massive MIMO Uplink 2018 Ingår i: IEEE Transactions on Information Forensics and Security. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1556-6013 .- 1556-6021. ; 13:1, s. 210-223 Tidskriftsartikel (refereegranskat)abstract We design a jamming-resistant receiver scheme to enhance the robustness of a massive MIMO uplink system against jamming. We assume that a jammer attacks the system both in the pilot and data transmission phases. The key feature of the proposed scheme is that, in the pilot phase, the base station estimates not only the legitimate channel, but also the jamming channel by exploiting a purposely unused pilot sequence. The jamming channel estimate is used to construct linear receiver filters that reject the impact of the jamming signal. The performance of the proposed scheme is analytically evaluated using the asymptotic properties of massive MIMO. The best regularized zero-forcing receiver and the optimal power allocations for the legitimate system and the jammer are also studied. Numerical results are provided to verify our analysis and show that the proposed scheme greatly improves the achievable rates, as compared with conventional receivers. Interestingly, the proposed scheme works particularly well under strong jamming attacks, since the improved estimate of the jamming channel outweighs the extra jamming power.
10.	Fronthaler, Hartwig, et al. (författare) Fingerprint Image-Quality Estimation and its Application to Multialgorithm Verification 2008 Ingår i: IEEE Transactions on Information Forensics and Security. - New York, N.Y. : IEEE Signal Processing Society. - 1556-6013 .- 1556-6021. ; 3:2, s. 331-338 Tidskriftsartikel (refereegranskat)abstract Signal-quality awareness has been found to increase recognition rates and to support decisions in multisensor environments significantly. Nevertheless, automatic quality assessment is still an open issue. Here, we study the orientation tensor of fingerprint images to quantify signal impairments, such as noise, lack of structure, blur, with the help of symmetry descriptors. A strongly reduced reference is especially favorable in biometrics, but less information is not sufficient for the approach. This is also supported by numerous experiments involving a simpler quality estimator, a trained method (NFIQ), as well as the human perception of fingerprint quality on several public databases. Furthermore, quality measurements are extensively reused to adapt fusion parameters in a monomodal multialgorithm fingerprint recognition environment. In this study, several trained and nontrained score-level fusion schemes are investigated. A Bayes-based strategy for incorporating experts' past performances and current quality conditions, a novel cascaded scheme for computational efficiency, besides simple fusion rules, is presented. The quantitative results favor quality awareness under all aspects, boosting recognition rates and fusing differently skilled experts efficiently as well as effectively (by training).
11.	Giaretta, Alberto, 1988-, et al. (författare) Security Vulnerabilities and Countermeasures for Target Localization in Bio-NanoThings Communication Networks 2016 Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 11:4, s. 665-676 Tidskriftsartikel (refereegranskat)abstract The emergence of molecular communication has provided an avenue for developing biological nanonetworks. Synthetic biology is a platform that enables reprogramming cells, which we refer to as Bio-NanoThings, that can be assembled to create nanonetworks. In this paper, we focus on specific Bio-NanoThings, i.e, bacteria, where engineering their ability to emit or sense molecules can result in functionalities, such as cooperative target localization. Although this opens opportunities, e.g., for novel healthcare applications of the future, this can also lead to new problems, such as a new form of bioterrorism. In this paper, we investigate the disruptions that malicious Bio-NanoThings (M-BNTs) can create for molecular nanonetworks. In particular, we introduce two types of attacks: blackhole and sentry attacks. In blackhole attack M-BNTs emit attractant chemicals to draw-in the legitimate Bio-NanoThings (L-BNTs) from searching for their target, while in the sentry attack, the M-BNTs emit repellents to disperse the L-BNTs from reaching their target. We also present a countermeasure that L-BNTs can take to be resilient to the attacks, where we consider two forms of decision processes that includes Bayes' rule as well as a simple threshold approach. We run a thorough set of simulations to assess the effectiveness of the proposed attacks as well as the proposed countermeasure. Our results show that the attacks can significantly hinder the regular behavior of Bio-NanoThings, while the countermeasures are effective for protecting against such attacks.
12.	Gonzalez-Sosa, Ester, et al. (författare) Facial Soft Biometrics for Recognition in the Wild : Recent Works, Annotation and Evaluation 2018 Ingår i: IEEE Transactions on Information Forensics and Security. - Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 13:8, s. 2001-2014 Tidskriftsartikel (refereegranskat)abstract The role of soft biometrics to enhance person recognition systems in unconstrained scenarios has not been extensively studied. Here, we explore the utility of the following modalities: gender, ethnicity, age, glasses, beard, and moustache. We consider two assumptions: 1) manual estimation of soft biometrics and 2) automatic estimation from two commercial off-the-shelf systems (COTS). All experiments are reported using the labeled faces in the wild (LFW) database. First, we study the discrimination capabilities of soft biometrics standalone. Then, experiments are carried out fusing soft biometrics with two state-of-the-art face recognition systems based on deep learning. We observe that soft biometrics is a valuable complement to the face modality in unconstrained scenarios, with relative improvements up to 40%/15% in the verification performance when using manual/automatic soft biometrics estimation. Results are reproducible as we make public our manual annotations and COTS outputs of soft biometrics over LFW, as well as the face recognition scores. © 2018 IEEE.
13.	Gratton, Cristiano, et al. (författare) Privacy-Preserved Distributed Learning With Zeroth-Order Optimization 2022 Ingår i: IEEE Transactions on Information Forensics and Security. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1556-6013 .- 1556-6021. ; 17, s. 265-279 Tidskriftsartikel (refereegranskat)abstract We develop a privacy-preserving distributed algorithm to minimize a regularized empirical risk function when the first-order information is not available and data is distributed over a multi-agent network. We employ a zeroth-order method to minimize the associated augmented Lagrangian function in the primal domain using the alternating direction method of multipliers (ADMM). We show that the proposed algorithm, named distributed zeroth-order ADMM (D-ZOA), has intrinsic privacy-preserving properties. Most existing privacy-preserving distributed optimization/estimation algorithms exploit some perturbation mechanism to preserve privacy, which comes at the cost of reduced accuracy. Contrarily, by analyzing the inherent randomness due to the use of a zeroth-order method, we show that D-ZOA is intrinsically endowed with (epsilon, delta)-differential privacy. In addition, we employ the moments accountant method to show that the total privacy leakage of D-ZOA grows sublinearly with the number of ADMM iterations. D-ZOA outperforms the existing differentially-private approaches in terms of accuracy while yielding similar privacy guarantee. We prove that D-ZOA reaches a neighborhood of the optimal solution whose size depends on the privacy parameter. The convergence analysis also reveals a practically important trade-off between privacy and accuracy. Simulation results verify the desirable privacy-preserving properties of D-ZOA and its superiority over the state-of-the-art algorithms as well as its network-wide convergence.
14.	Günlü, Onur, et al. (författare) Secure and Private Distributed Source Coding With Private Keys and Decoder Side Information 2023 Ingår i: IEEE Transactions on Information Forensics and Security. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1556-6013 .- 1556-6021. ; 18, s. 3803-3816 Tidskriftsartikel (refereegranskat)abstract The distributed source coding problem is extended by positing that noisy measurements of a remote source are the correlated random variables that should be reconstructed at another terminal. We consider a secure and private distributed lossy source coding problem with two encoders and one decoder such that (i) all terminals noncausally observe a noisy measurement of the remote source; (ii) a private key is available to each legitimate encoder and all private keys are available to the decoder; (iii) rate-limited noiseless communication links are available between each encoder and the decoder; (iv) the amount of information leakage to an eavesdropper about the correlated random variables is defined as (v) secrecy leakage, and privacy leakage is measured with respect to the remote source; and (vi) two passive attack scenarios are considered, where a strong eavesdropper can access both communication links and a weak eavesdropper can choose only one of the links to access. Inner and outer bounds on the rate regions defined under secrecy, privacy, communication, and distortion constraints are derived for both passive attack scenarios. When one or both sources should be reconstructed reliably, the rate region bounds are simplified.
15.	Hoang, Tiep M., et al. (författare) Detection of Spoofing Attacks in Aeronautical Ad-hoc Networks Using Deep Autoencoders 2022 Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 17, s. 1010-1023 Tidskriftsartikel (refereegranskat)abstract We consider an aeronautical ad-hoc network relying on aeroplanes operating in the presence of a spoofer. The aggregated signal received by the terrestrial base station is considered as 'clean' or 'normal', if the legitimate aeroplanes transmit their signals and there is no spoofing attack. By contrast, the received signal is considered as 'spurious' or 'abnormal' in the face of a spoofing signal. An autoencoder (AE) is trained to learn the characteristics/features from a training dataset, which contains only normal samples associated with no spoofing attacks. The AE takes original samples as its input samples and reconstructs them at its output. Based on the trained AE, we define the detection thresholds of our spoofing discovery algorithm. To be more specific, contrasting the output of the AE against its input will provide us with a measure of geometric waveform similarity/dissimilarity in terms of the peaks of curves. To quantify the similarity between unknown testing samples and the given training samples (including normal samples), we first propose a so-called deviation-based algorithm. Furthermore, we estimate the angle of arrival (AoA) from each legitimate aeroplane and propose a so-called AoA-based algorithm. Then based on a sophisticated amalgamation of these two algorithms, we form our final detection algorithm for distinguishing the spurious abnormal samples from normal samples under a strict testing condition. In conclusion, our numerical results show that the AE improves the trade-off between the correct spoofing detection rate and the false alarm rate as long as the detection thresholds are carefully selected.
16.	Kalantari, A., et al. (författare) Secrecy Analysis on Network Coding in Bidirectional Multibeam Satellite Communications 2015 Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 10:9, s. 1862-1874 Tidskriftsartikel (refereegranskat)abstract Network coding is an efficient means to improve the spectrum efficiency of satellite communications. However, its resilience to eavesdropping attacks is not well understood. This paper studies the confidentiality issue in a bidirectional satellite network consisting of two mobile users who want to exchange message via a multibeam satellite using the XOR network coding protocol. We aim to maximize the sum secrecy rate by designing the optimal beamforming vector along with optimizing the return and forward link time allocation. The problem is nonconvex, and we find its optimal solution using semidefinite programming together with a 1-D search. For comparison, we also solve the sum secrecy rate maximization problem for a conventional reference scheme without using network coding. Simulation results using realistic system parameters demonstrate that the bidirectional scheme using network coding provides considerably higher secrecy rate compared with that of the conventional scheme.
17.	Karlsson, Marcus, et al. (författare) Jamming a TDD Point-to-Point Link Using Reciprocity-Based MIMO 2017 Ingår i: IEEE Transactions on Information Forensics and Security. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1556-6013 .- 1556-6021. ; 12:12, s. 2957-2970 Tidskriftsartikel (refereegranskat)abstract We present a method for jamming a time-division duplex link using a transceiver with a large number of antennas. By utilizing beamforming, a jammer with M antennas can degrade the spectral efficiency of the primary link more than conventional omnidirectional jammers under the same power constraint, or perform equally well with approximately 1/M of the output power. The jammer operates without any prior knowledge of channels to the legitimate transmitters, or the legitimate signals by relying on channel reciprocity.
18.	Khan, Zulfiqar Hasan, 1976, et al. (författare) Joint Feature Correspondences and Appearance Similarity for Robust Visual Object Tracking 2010 Ingår i: IEEE Transactions on Information Forensics and Security. - 1556-6021 .- 1556-6013. ; 5:3, s. 591-606 Tidskriftsartikel (refereegranskat)abstract A novel visual object tracking scheme is proposed by using joint point feature correspondences and object appearance similarity. For point feature-based tracking, we propose a candidate tracker that simultaneously exploits two separate sets of point feature correspondences in the foreground and in the surrounding background, where background features are exploited for the indication of occlusions. Feature points in these two sets are then dynamically maintained. For object appearance-based tracking, we propose a candidate tracker based on an enhanced anisotropic mean shift with a fully tunable (5 degrees of freedom) bounding box that is partially guided by the above feature point tracker. Both candidate trackers contain a re-initialization process to reset the tracker in order to prevent accumulated tracking error propagation in frames. In addition, a novel online learning method is introduced to the enhanced mean shift-based candidate tracker. The reference object distribution is updated in each time interval if there is an indication of stable and reliable tracking without background interferences. By dynamically updating the reference object model, tracking is further improved by using a more accurate object appearance similarity measure. An optimal selection criterion is applied to the final tracker based on the results of these candidate trackers. Experiments have been conducted on several videos containing a range of complex scenarios. To evaluate the performance, the proposed scheme is further evaluated using three objective criteria, and compared with two existing trackers. All our results have shown that the proposed scheme is very robust and has yielded a marked improvement in terms of tracking drift, tightness and accuracy of tracked bounding boxes, especially for complex video scenarios containing long-term partial occlusions or intersections, deformation, or background clutter with similar color distributions to the foreground object.
19.	Kim, Dohyung, et al. (författare) Security of Cached Content in NDN 2017 Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 12:12, s. 2933-2944 Tidskriftsartikel (refereegranskat)abstract In Named-Data Networking (NDN), content is cached in network nodes and served for future requests. This property of NDN allows attackers to inject poisoned content into the network and isolate users from valid content sources. Since a digital signature is embedded in every piece of content in NDN architecture, poisoned content is discarded if routers perform signature verification; however, if every content is verified by every router, it would be overly expensive to do. In our preliminary work, we have suggested a content verification scheme that minimizes unnecessary verification and favors already verified content in the content store, which reduces the verification overhead by as much as 90% without failing to detect every piece of poisoned content. Under this scheme, however, routers are vulnerable to verification attack, in which a large amount of unverified content is accessed to exhaust system resources. In this paper, we carefully look at the possible concerns of our preliminary work, including verification attack, and present a simple but effective solution. The proposed solution mitigates the weakness of our preliminary work and allows this paper to be deployed for real-world applications.
20.	Kollreider, Klaus, et al. (författare) Real-Time Face Detection and Motion Analysis With Application in “Liveness” Assessment 2007 Ingår i: IEEE Transactions on Information Forensics and Security. - New York : IEEE Press. - 1556-6013 .- 1556-6021. ; 2:3 part 2, s. 548-558 Tidskriftsartikel (refereegranskat)abstract A robust face detection technique along with mouth localization, processing every frame in real time (video rate), is presented. Moreover, it is exploited for motion analysis onsite to verify "liveness" as well as to achieve lip reading of digits. A methodological novelty is the suggested quantized angle features ("quangles") being designed for illumination invariance without the need for preprocessing (e.g., histogram equalization). This is achieved by using both the gradient direction and the double angle direction (the structure tensor angle), and by ignoring the magnitude of the gradient. Boosting techniques are applied in a quantized feature space. A major benefit is reduced processing time (i.e., that the training of effective cascaded classifiers is feasible in very short time, less than 1 h for data sets of order 104). Scale invariance is implemented through the use of an image scale pyramid. We propose "liveness" verification barriers as applications for which a significant amount of computation is avoided when estimating motion. Novel strategies to avert advanced spoofing attempts (e.g., replayed videos which include person utterances) are demonstrated. We present favorable results on face detection for the YALE face test set and competitive results for the CMU-MIT frontal face test set as well as on "liveness" verification barriers.
21.	Kumar, Pardeep, et al. (författare) Anonymous Secure Framework in Connected Smart Home Environments 2017 Ingår i: IEEE Transactions on Information Forensics and Security. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1556-6013 .- 1556-6021. ; 12:4, s. 968-979 Tidskriftsartikel (refereegranskat)abstract The smart home is an environment, where heterogeneous electronic devices and appliances are networked together to provide smart services in a ubiquitous manner to the individuals. As the homes become smarter, more complex, and technology dependent, the need for an adequate security mechanism with minimum individuals intervention is growing. The recent serious security attacks have shown how the Internet-enabled smart homes can be turned into very dangerous spots for various ill intentions, and thus lead the privacy concerns for the individuals. For instance, an eavesdropper is able to derive the identity of a particular device/appliance via public channels that can be used to infer in the life pattern of an individual within the home area network. This paper proposes an anonymous secure framework (ASF) in connected smart home environments, using solely lightweight operations. The proposed framework in this paper provides efficient authentication and key agreement, and enables devices (identity and data) anonymity and unlinkability. One-time session key progression regularly renews the session key for the smart devices and dilutes the risk of using a compromised session key in the ASF. It is demonstrated that computation complexity of the proposed framework is low as compared with the existing schemes, while security has been significantly improved.
22.	Li, Zuxing, et al. (författare) Privacy Against a Hypothesis Testing Adversary 2019 Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 14:6, s. 1567-1581 Tidskriftsartikel (refereegranskat)abstract Privacy against an adversary (AD) that tries to detect the underlying privacy-sensitive data distribution is studied. The original data sequence is assumed to come from one of the two known distributions, and the privacy leakage is measured by the probability of error of the binary hypothesis test carried out by the AD. A management unit (MU) is allowed to manipulate the original data sequence in an online fashion while satisfying an average distortion constraint. The goal of the MU is to maximize the minimal type II probability of error subject to a constraint on the type I probability of error assuming an adversarial Neyman-Pearson test, or to maximize the minimal error probability assuming an adversarial Bayesian test. The asymptotic exponents of the maximum minimal type II probability of error and the maximum minimal error probability are shown to be characterized by a Kullback-Leibler divergence rate and a Chernoff information rate, respectively. Privacy performances of particular management policies, the memoryless hypothesis-aware policy and the hypothesis-unaware policy with memory, are compared. The proposed formulation can also model adversarial example generation with minimal data manipulation to fool classifiers. At last, the results are applied to a smart meter privacy problem, where the user's energy consumption is manipulated by adaptively using a renewable energy source in order to hide user's activity from the energy provider.
23.	Luo, Hongmin, et al. (författare) Preventing Distributed Denial-of-Service Flooding Attacks with Dynamic Path Identifiers 2017 Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 12:8, s. 1801-1805 Tidskriftsartikel (refereegranskat)abstract In recent years, there are increasing interests in using path identifiers (PIDs) as inter-domain routing objects. However, the PIDs used in existing approaches are static, which makes it easy for attackers to launch distributed denial-ofservice (DDoS) flooding attacks. To address this issue, in this paper, we present the design, implementation, and evaluation of D-PID, a framework that uses PIDs negotiated between neighboring domains as inter-domain routing objects. In DPID, the PID of an inter-domain path connecting two domains is kept secret and changes dynamically. We describe in detail how neighboring domains negotiate PIDs, how to maintain ongoing communications when PIDs change. We build a 42-node prototype comprised by six domains to verify D-PID’s feasibility and conduct extensive simulations to evaluate its effectiveness and cost. The results from both simulations and experiments show that D-PID can effectively prevent DDoS attacks.
24.	Madhusudhanan, Sheema, et al. (författare) PRIMϵ: Novel Privacy-preservation Model with Pattern Mining and Genetic Algorithm 2024 Ingår i: IEEE Transactions on Information Forensics and Security. - : Institute of Electrical and Electronics Engineers (IEEE). - 1556-6013 .- 1556-6021. ; 19, s. 571-585 Tidskriftsartikel (refereegranskat)abstract This paper proposes a novel agglomerated privacy-preservation model integrated with data mining and evolutionary Genetic Algorithm (GA). Privacy-pReservIng with Minimum Epsilon (PRIMϵ) delivers minimum privacy budget (ϵ) value to protect personal or sensitive data during data mining and publication. In this work, the proposed Pattern identification in the Locale of Users with Mining (PLUM) algorithm, identifies frequent patterns from dataset containing users’ sensitive data. ϵ-allocation by Differential Privacy (DP) is achieved in PRIMϵ with GA PRIMϵ , yielding a quantitative measure of privacy loss (ϵ) ranging from 0.0001 to 0.045. The proposed model maintains the trade-off between privacy and data utility with an average relative error of 0.109 on numerical data and an Earth Mover’s Distance (EMD) metric in the range between [0.2,1.3] on textual data. PRIMϵ model is verified with Probabilistic Computational Tree Logic (PCTL) and proved to accept DP data only when ϵ ≤ 0.5. The work demonstrated resilience of model against background knowledge, membership inference, reconstruction, and privacy budget attack. PRIMϵ is compared with existing techniques on DP and is found to be linearly scalable with worst time complexity of O(n log n) .
25.	Mohapatra, Parthajit, et al. (författare) Secure Communications for the Two-user Broadcast Channel with Random Traffic 2018 Ingår i: IEEE Transactions on Information Forensics and Security. - : IEEE Signal Processing Society. - 1556-6013 .- 1556-6021. ; 13:9, s. 2294-2309 Tidskriftsartikel (refereegranskat)abstract In this work, we study the stability region of the two-user broadcast channel (BC) with bursty data arrivals and security constraints. It is assumed that one of the receivers has a secrecy constraint, i.e., its packets need to be kept secret from the other receiver, which is defined based on SINR. The receiver with secrecy constraint has full-duplex capability to send a jamming signal for improving its service rate. The stability region of the two-user BC with secrecy constraint is characterized for the general decoding case. Then, assuming two different decoding schemes the respective stability regions are derived. The fullduplex operation of receiver results in self-interference, and the effect of imperfect self-interference cancelation on the stability region is also investigated. The stability region of the BC with a secrecy constraint, where the receivers do not have full duplex capability can be obtained as a special case of the results derived in this paper. In addition, the paper considers the problem of maximizing the saturated throughput of the queue for which there is no secrecy constraint under minimum service guarantees for the other queue. The results provide new insights on the effect of the secrecy constraint on the stability region of the BC. It is found that the stability region with secrecy constraint is sensitive to the degree of self-interference cancelation.

Skapa referenser, mejla, bekava och länka

Länka till träfflistan

Träfflista för sökning "L773:1556 6013 OR L773:1556 6021 "

Avgränsa träffmängd

År