A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Filters
Gigahertz measurement-device-independent quantum key distribution using directly modulated lasers
2021
npj Quantum Information
Our design enables secure key rates that improve upon the state of the art by an order of magnitude, up to 8 bps at 54 dB channel loss and 2 kbps in the finite-size regime for 30 dB channel loss. ...
complexity and low secure key rates. ...
ACKNOWLEDGEMENTS We acknowledge EPSRC funding through the UK Quantum Communications Hub (Grant EP/M013472/1) and from the European Union Horizon 2020 Research and Innovation Programme (Grant 857156 "OPENQKD ...
doi:10.1038/s41534-021-00394-2
fatcat:u52w6di7nrdylohvrpbvppizae
On Secure and Usable Program Obfuscation: A Survey
[article]
2017
arXiv
pre-print
Recently in 2013, Garg et al. have achieved a breakthrough in secure program obfuscation with a graded encoding mechanism and they have shown that it can fulfill a compelling security property, i.e., indistinguishability ...
., lexical obfuscation, control obfuscation) implemented in mainstream obfuscation tools are heuristic and have little security guarantee. ...
For boolean formulas P f ∈ {0, 1}, the finite state machine has one start state, two stop states (true and f alse), and several intermediate states. ...
arXiv:1710.01139v1
fatcat:tef5esco7rggthw2sjybnze4dy
Securing practical quantum communication systems with optical power limiters
[article]
2021
arXiv
pre-print
Controlling the energy of unauthorized light signals in a quantum cryptosystem is an essential criterion for implementation security. ...
security of plug-and-play quantum key distribution. ...
By controlling the input power below or above the power threshold P T h , the detector could be controlled to register fake-states. ...
arXiv:2012.08702v2
fatcat:fofg6r7sazadthfelil5k7eave
Layered obfuscation: a taxonomy of software obfuscation techniques for layered security
2020
Cybersecurity
Inspired by the classic idea of layered security for risk management, we propose layered obfuscation as a promising way to realize reliable software obfuscation. ...
Software obfuscation has been developed for over 30 years. A problem always confusing the communities is what security strength the technique can achieve. ...
Acknowledgments The work described in this paper was supported by the Research Grants Council of the Hong Kong Special Administrative Region, China (No. CUHK 14210717 of the General Research Fund). ...
doi:10.1186/s42400-020-00049-3
fatcat:jrymozivkvbkbd3aeg3redj4ne
Semantic-based Automated Reasoning for AWS Access Policies using SMT
2018
2018 Formal Methods in Computer Aided Design (FMCAD)
Permissions for these resources are defined by expressive access control policies. ...
ZELKOVA encodes the semantics of policies into SMT, compares behaviors, and verifies properties. It provides users a sound mechanism to detect misconfigurations of their policies. ...
The constraint "grades/" prefixOf s3Prefix encodes that "grades/" is a prefix of the variable s3Prefix. ...
doi:10.23919/fmcad.2018.8602994
dblp:conf/fmcad/BackesBCDGLRTV18
fatcat:jnyqutkzbrdz3lhlhkud6gig4i
Information Encoding with Optical Dielectric Metasurface via Independent Multichannels
[article]
2018
arXiv
pre-print
This 2D mode encoding strategy paves a novel pathway for escalating the security level of information in multichannel information encryption, anti-counterfeiting, optical data storage, and information ...
Six independent channels by two circular polarization states (RCP and LCP) and three visible wavelengths (633 nm, 532 nm and 473 nm) in 2D mode can produce 63 combinations available to information encoding ...
and capacity of encryption, which would make the encoded information more secure. ...
arXiv:1805.11246v1
fatcat:pntktkgqcjhqlj7porw35elgeq
Generalized time-bin quantum random number generator with uncharacterized devices
2024
EPJ Quantum Technology
We investigate the generic case of time-bin encoding scheme, define various input (state preparation) and outcome (measurement) subspaces, and discuss the optimal scenarios to obtain maximum entropy. ...
Several input designs were experimentally tested and analyzed for their conceivable outcome arrangements. ...
This model presents a robust foundation for evaluating the impact of finite-size effects on the security and reliability of the system. ...
doi:10.1140/epjqt/s40507-024-00227-z
fatcat:3szxtjuqirbmbp7c2zeq32upl4
VLSI Implementation of Cryptographic Algorithms Techniques: A Literature Review
[article]
2021
arXiv
pre-print
Through the years, the flow of Data and its transmission have increased tremendously and so has the security issues to it. ...
In this paper, the review of various aspects of VLSI's implementation of encryption and decryption are covered. ...
The proposed controller has six different states, which are shown in a form of a finite state machine (FSM). ...
arXiv:2110.13407v1
fatcat:rg5erm357vf7djr46rxd2r3wfm
Implementing BP-Obfuscation Using Graph-Induced Encoding
2017
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17
Our implementation is the first obfuscation attempt using the GGH15 graded encoding scheme, offering performance advantages over other graded encoding methods when obfuscating finite-state machines with ...
In out most demanding setting, we were able to obfuscate programs with input length of 20 nibbles (80 bits) and over 100 states, which seems out of reach for prior implementations. ...
Our use of the GGH15 encoding may offer performance advantages over implementations that use the encoding from GGH13 [9] or CLT13 [7] , especially for obfuscating finite-state machines with many states ...
doi:10.1145/3133956.3133976
dblp:conf/ccs/HaleviHSS17
fatcat:jity63zaj5hxzgiyecobtwze7u
Implementation of FPGA hardware architecture for optimized SPIHT coder using 2DWT-A
2022
TAGA Journal
The requirements, power and delay for the proposed method are optimized considerably when compared to the existing techniques. ...
In SPIHT encoder architecture, the hardware efficient binary arithmetic encoder with position control unit is used to avoid prefix zeros during arithmetic computation which replaces the hardware expensive ...
Finite state machine diagram of the 2DWT-A based SPIHT
Figure 9 . 9 Figure 9. ...
doi:10.37896/pd91.3/91311
fatcat:g2unanyxqbf2hatr4g7w2mf2te
Static verification of security requirements in role based CSCW systems
2003
Proceedings of the eighth ACM symposium on Access control models and technologies - SACMAT '03
In this paper, we present static verification of security requirements for CSCW systems using finite-state techniques, i.e., model checking. ...
The primary contribution of this paper is a methodology for verification of security requirements during designing collaboration systems. ...
In this paper, we present a role based model to specify both coordination and security requirements and utilize finite state models for verification of the specification. ...
doi:10.1145/775412.775438
dblp:conf/sacmat/AhmedT03
fatcat:mbsf6wcpfjc6fb55z55re6x3wm
Static verification of security requirements in role based CSCW systems
2003
Proceedings of the eighth ACM symposium on Access control models and technologies - SACMAT '03
In this paper, we present static verification of security requirements for CSCW systems using finite-state techniques, i.e., model checking. ...
The primary contribution of this paper is a methodology for verification of security requirements during designing collaboration systems. ...
In this paper, we present a role based model to specify both coordination and security requirements and utilize finite state models for verification of the specification. ...
doi:10.1145/775436.775438
fatcat:3s74lyql7bhgzpocforx2oixwq
Five examples of web-services for illustrating requirements for security architecture
2011
2011 International Conference on Data and Knowledge Engineering (ICDKE)
The tension caused by the need for expressive power when formulating security rules and the need to keep computational complexity low when undertaking the necessary access rule evaluations is a major challenge ...
in the formulation of good security architecture. ...
Should the quantifiers of first order logic (there exists x: ∃x, and for all x: ∀x) be used in a language for defining security validation, security policy, or access control? ...
doi:10.1109/icdke.2011.6053929
dblp:conf/nss/AddieMDC11
fatcat:tdg3xi74czgifh6k3oeqa6y4pm
Obfuscating Conjunctions
2015
Journal of Cryptology
We conjecture that our construction is secure for any conjunction, regardless of the distribution from which it is drawn. ...
We offer supporting evidence for this conjecture, proving that our obfuscator is secure for any conjunction against generic adversaries. ...
We thank Ryo Nishimaki for pointing us to the zeroing attack on [GGH13] , and the authors of [CLT13] for discussing the applicability of such attack on their scheme. ...
doi:10.1007/s00145-015-9221-5
fatcat:s2jt4vvpdvb5xix3er7c2dbweq
Obfuscating Conjunctions
[chapter]
2013
Lecture Notes in Computer Science
We conjecture that our construction is secure for any conjunction, regardless of the distribution from which it is drawn. ...
We offer supporting evidence for this conjecture, proving that our obfuscator is secure for any conjunction against generic adversaries. ...
We thank Ryo Nishimaki for pointing us to the zeroing attack on [GGH13] , and the authors of [CLT13] for discussing the applicability of such attack on their scheme. ...
doi:10.1007/978-3-642-40084-1_24
fatcat:pmltma7cpvb53f6dzrafjnbyi4
« Previous
Showing results 1 — 15 out of 4,977 results