Searcharxiv⌕ Search

arXiv subjects

Derek Abbott

Publications and source records attributed to Derek Abbott.

At least 37 records · Page 2Linked to original sources

NTD: Non-Transferability Enabled Backdoor Detection

A backdoor deep learning (DL) model behaves normally upon clean inputs but misbehaves upon trigger inputs as the backdoor attacker desires, posing severe consequences to DL model deployments. State-of-the-art defenses are either limited to specific backdoor attacks (source-agnostic attacks) or non-user-friendly in that machine learning (ML) expertise or expensive computing resources are required. This work observes that all existing backdoor attacks have an inevitable intrinsic weakness, non-transferability, that is, a trigger input hijacks a backdoored model but cannot be effective to another model that has not been implanted with the same backdoor. With this key observation, we propose non-transferability enabled backdoor detection (NTD) to identify trigger inputs for a model-under-test (MUT) during run-time.Specifically, NTD allows a potentially backdoored MUT to predict a class for an input. In the meantime, NTD leverages a feature extractor (FE) to extract feature vectors for the input and a group of samples randomly picked from its predicted class, and then compares similarity between the input and the samples in the FE's latent space. If the similarity is low, the input is an adversarial trigger input; otherwise, benign. The FE is a free pre-trained model privately reserved from open platforms. As the FE and MUT are from different sources, the attacker is very unlikely to insert the same backdoor into both of them. Because of non-transferability, a trigger effect that does work on the MUT cannot be transferred to the FE, making NTD effective against different types of backdoor attacks. We evaluate NTD on three popular customized tasks such as face recognition, traffic sign recognition and general animal classification, results of which affirm that NDT has high effectiveness (low false acceptance rate) and usability (low false rejection rate) with low detection latency.

cs.CR↗

Equating the area sums of alternative sectors in a circle

We determine the conditions resulting from equating the area sums of alternative sectors in a circle generated by four, two, and three straight lines, respectively, that connect opposite points on its circumference while passing through a point that is arbitrarily placed within the circle.

math.GM↗

Game theoretical modelling of network/cybersecurity

Game theory is an established branch of mathematics that offers a rich set of mathematical tools for multi-person strategic decision making that can be used to model the interactions of decision makers in security problems who compete for limited and shared resources. This article presents a review of the literature in the area of game theoretical modelling of network/cybersecurity.

cs.GT↗

Hilbert's forgotten equation, the equivalence principle and velocity dependence of free fall

Referring to the behavior of accelerating objects in special relativity, and applying the principle of equivalence, one expects that the coordinate acceleration of point masses under gravity will be velocity dependent. Then, using the Schwarzschild solution, we analyze the similar case of masses moving on timelike geodesics, which reproduces a little known result by Hilbert from 1917, describing this dependence. We find that the relativistic correction term for the acceleration based on general relativity differs by a factor of two from the simpler acceleration arguments in flat space. As we might expect from the general theory, the velocity dependence can be removed by a suitable coordinate transformation, such as the Painlev{é}-Gullstrand coordinate system. The validity of this approach is supported by previous authors who have demonstrated vacuum solutions to general relativity producing true flat space metrics for uniform gravitational fields. We suggest explicit experiments could be undertaken to test the property of velocity dependence.

physics.gen-ph↗

Quantum strategies and evolutionary stability (in Urdu)

This article in Urdu presents an introduction to extension of an established branch of mathematics called game theory towards the quantum domain. We describe concepts of quantum games and evolutionary stability and go through some of the unanswered questions in this research area.

quant-ph↗

A game theoretical perspective on the quantum probabilities associated with a GHZ state

In the standard approach to quantum games, players' moves are local unitary transformations on an entangled state that is subsequently measured. Players' payoffs are then obtained as expected values of the entries in the payoff matrix of the classical game on a set of quantum probabilities obtained from the quantum measurement. In this paper, we approach quantum games from a diametrically opposite perspective. We consider a classical three-player symmetric game along with a known expression for a set of quantum probabilities relevant to a tripartite Einstein-Podolsky-Rosen (EPR) experiment that depends on three players' directional choices in the experiment. We define the players' moves as their directional choices in an EPR setting and then express their payoff relations in the resulting quantum game in terms of their directional choices, the entries of the payoff matrix, and the quantum probability distribution relevant to the tripartite EPR experiment.

quant-ph↗

The equivalence of Bell's inequality and the Nash inequality in a quantum game-theoretic setting

The interaction of competing agents is described by classical game theory. It is now well known that this can be extended to the quantum domain, where agents obey the rules of quantum mechanics. This is of emerging interest for exploring quantum foundations, quantum protocols, quantum auctions, quantum cryptography, and the dynamics of quantum cryptocurrency, for example. In this paper, we investigate two-player games in which a strategy pair can exist as a Nash equilibrium when the games obey the rules of quantum mechanics. Using a generalized Einstein-Podolsky-Rosen (EPR) setting for two-player quantum games, and considering a particular strategy pair, we identify sets of games for which the pair can exist as a Nash equilibrium only when Bell's inequality is violated. We thus determine specific games for which the Nash inequality becomes equivalent to Bell's inequality for the considered strategy pair.

quant-ph↗

Kidnapping Model: An Extension of Selten's Game

Selten's game is a kidnapping model where the probability of capturing the kidnapper is independent of whether the hostage has been released or executed. Most often, in view of the elevated sensitivities involved, authorities put greater effort and resources into capturing the kidnapper if the hostage has been executed, in contrast to the case when a ransom is paid to secure the hostage's release. In this paper, we study the asymmetric game when the probability of capturing the kidnapper depends on whether the hostage has been executed or not and find a new uniquely determined perfect equilibrium point in Selten's game.

cs.GT↗

Modeling Attack Resilient Reconfigurable Latent Obfuscation Technique for PUF based Lightweight Authentication

Physical unclonable functions (PUFs), as hardware security primitives, exploit manufacturing randomness to extract hardware instance-specific secrets. One of most popular structures is time-delay based Arbiter PUF attributing to large number of challenge response pairs (CRPs) yielded and its compact realization. However, modeling building attacks threaten most variants of APUFs that are usually employed for strong PUF-oriented application---lightweight authentication---without reliance on the securely stored digital secrets based standard cryptographic protocols. In this paper, we investigate a reconfigurable latent obfuscation technique endowed PUF construction, coined as OB-PUF, to maintain the security of elementary PUF CRPs enabled authentication where a CRP is never used more than once. The obfuscation---determined by said random patterns---conceals and distorts the relationship between challenge-response pairs capable of thwarting a model building adversary needing to know the exact relationship between challenges and responses. A bit further, the obfuscation is hidden and reconfigured on demand, in other words, the patterns are not only invisible but also act as one-time pads that are only employed once per authentication around and then discarded. As a consequence, the OB-PUF demonstrates significant resistance to the recent revealed powerful Evaluation Strategy (ES) based modeling attacks where the direct relationship between challenge and response is even not a must. The OB-PUF's uniqueness and reliability metrics are also systematically studied followed by formal authentication capability evaluations.

cs.CR↗

Detecting Recycled Commodity SoCs: Exploiting Aging-Induced SRAM PUF Unreliability

A physical unclonable function (PUF), analogous to a human fingerprint, has gained an enormous amount of attention from both academia and industry. SRAM PUF is among one of the popular silicon PUF constructions that exploits random initial power-up states from SRAM cells to extract hardware intrinsic secrets for identification and key generation applications. The advantage of SRAM PUFs is that they are widely embedded into commodity devices, thus such a PUF is obtained without a custom design and virtually free of implementation costs. A phenomenon known as `aging' alters the consistent reproducibility---reliability---of responses that can be extracted from a readout of a set of SRAM PUF cells. Similar to how a PUF exploits undesirable manufacturing randomness for generating a hardware intrinsic fingerprint, SRAM PUF unreliability induced by aging can be exploited to detect recycled commodity devices requiring no additional cost to the device. In this context, the SRAM PUF itself acts as an aging sensor by exploiting responses sensitive to aging. We use SRAMs available in pervasively deployed commercial off-the-shelf micro-controllers for experimental validations, which complements recent work demonstrated in FPGA platforms, and we present a simplified detection methodology along experimental results. We show that less than 1,000 SRAM responses are adequate to guarantee that both false acceptance rate and false rejection rate are no more than 0.001.

cs.CR↗

Safety in Numbers: Anonymization Makes Centralized Systems Trustworthy

Decentralized systems can be more resistant to operator mischief than centralized ones, but they are substantially harder to develop, deploy, and maintain. This cost is dramatically reduced if the decentralized part of the system can be made highly generic, and thus incorporated into many different applications. We show how existing anonymization systems can serve this purpose, securing a public database against equivocation by its operator without the need for cooperation by the database owner. We derive bounds on the probability of successful equivocation, and in doing so, we demonstrate that anonymization systems are not only important for user privacy, but that by providing privacy to machines they have a wider value within the internet infrastructure

cs.CR↗

Exploiting PUF Models for Error Free Response Generation

Physical unclonable functions (PUF) extract secrets from randomness inherent in manufacturing processes. PUFs are utilized for basic cryptographic tasks such as authentication and key generation, and more recently, to realize key exchange and bit commitment requiring a large number of error free responses from a strong PUF. We propose an approach to eliminate the need to implement expensive on-chip error correction logic implementation and the associated helper data storage to reconcile naturally noisy PUF responses. In particular, we exploit a statistical model of an Arbiter PUF (APUF) constructed under the nominal operating condition during the challenge response enrollment phase by a trusted party to judiciously select challenges that yield error-free responses even across a wide operating conditions, specifically, a $ \pm 20\% $ supply voltage variation and a $ 40^{\crc} $ temperature variation. We validate our approach using measurements from two APUF datasets. Experimental results indicate that large number of error-free responses can be generated on demand under worst-case when PUF response error rate is up to 16.68\%.

cs.CR↗

Generalizing the Lorentz transformations

In this paper we develop a framework allowing a natural extension of the Lorentz transformations. To begin, we show that by expanding conventional four-dimensional spacetime to eight-dimensions that a natural generalization is indeed obtained. We then find with these generalized coordinate transformations acting on Maxwell's equations that the electromagnetic field transformations are nevertheless unchanged. We find further, that if we assume the absence of magnetic monopoles, in accordance with Maxwell's theory, our generalized transformations are then restricted to be the conventional ones. While the conventional Lorentz transformations are indeed recovered from our framework, we nevertheless provide a new perspective into why the Lorentz transformations are constrained to be the conventional ones. Also, this generalized framework may assist in explaining several unresolved questions in electromagnetism as well as to be able to describe quasi magnetic monopoles found in spin-ice systems.

physics.gen-ph↗

Analysis of 3D-printed metal for rapid-prototyped reflective terahertz optics

We explore the potential of 3D metal printing to realize complex conductive terahertz devices. Factors impacting performance such as printing resolution, surface roughness, oxidation, and material loss are investigated via analytical, numerical, and experimental approaches. The high degree of control offered by a 3D-printed topology is exploited to realize a zone plate operating at 530 GHz. Reflection efficiency at this frequency is found to be over 90%. The high-performance of this preliminary device suggest that 3D metal printing can play a strong role in guided-wave and general beam control devices in the terahertz range.

physics.optics↗

The vector algebra war: a historical perspective

There are a wide variety of different vector formalisms currently utilized in engineering and physics. For example, Gibbs' three-vectors, Minkowski four-vectors, complex spinors in quantum mechanics, quaternions used to describe rigid body rotations and vectors defined in Clifford geometric algebra. With such a range of vector formalisms in use, it thus appears that there is as yet no general agreement on a vector formalism suitable for science as a whole. This is surprising, in that, one of the primary goals of nineteenth century science was to suitably describe vectors in three-dimensional space. This situation has also had the unfortunate consequence of fragmenting knowledge across many disciplines, and requiring a significant amount of time and effort in learning the various formalisms. We thus historically review the development of our various vector systems and conclude that Clifford's multivectors best fulfills the goal of describing vectorial quantities in three dimensions and providing a unified vector system for science.

physics.hist-ph↗

Geometric Algebra: A natural representation of three-space

Historically, there have been many attempts to produce an appropriate mathematical formalism for modeling the nature of physical space, such as Euclid's geometry, Descartes' system of Cartesian coordinates, the Argand plane, Hamilton's quaternions and Gibbs' vector system using the dot and cross products. We illustrate however, that Clifford's geometric algebra (GA) provides the most elegant description of physical space. Supporting this conclusion, we firstly show how geometric algebra subsumes the key elements of the competing formalisms and secondly how it provides an intuitive representation of the basic concepts of points, lines, areas and volumes. We also provide two examples where GA has been found to provide an improved description of two key physical phenomena, electromagnetism and quantum theory, without using tensors or complex vector spaces. This paper also provides pedagogical tutorial-style coverage of the various basic applications of geometric algebra in physics.

physics.hist-ph↗

Too good to be true: when overwhelming evidence fails to convince

Is it possible for a large sequence of measurements or observations, which support a hypothesis, to counterintuitively decrease our confidence? Can unanimous support be too good to be true? The assumption of independence is often made in good faith, however rarely is consideration given to whether a systemic failure has occurred. Taking this into account can cause certainty in a hypothesis to decrease as the evidence for it becomes apparently stronger. We perform a probabilistic Bayesian analysis of this effect with examples based on (i) archaeological evidence, (ii) weighing of legal evidence, and (iii) cryptographic primality testing. We find that even with surprisingly low systemic failure rates high confidence is very difficult to achieve and in particular we find that certain analyses of cryptographically-important numerical tests are highly optimistic, underestimating their false-negative rate by as much as a factor of $2^{80}$.

stat.AP↗

A brief study of time

Understanding the nature of time remains a key unsolved problem in science. Newton in the Principia asserted an absolute universal time that {\it `flows equably'}. Hamilton then proposed a mathematical unification of space and time within the framework of the quaternions that ultimately lead to the famous Minkowski formulation in 1908 using four-vectors. The Minkowski framework is found to provide a versatile formalism for describing the relationship between space and time in accordance with relativistic principles, but nevertheless fails to provide deeper insights into the physical origin of time and its properties. In this paper we begin with a recognition of the fundamental role played by three-dimensional space in physics that we model using the Clifford algebra multivector. From this geometrical foundation we are then able to identify a plausible origin for our concept of time. This geometrical perspective also allows us to make a key topological distinction between time and space, with time being a point-like quantity. The multivector then allows a generalized unification of time and space within a Minkowski-like description.

physics.gen-ph↗