ORCID Profile
0000-0001-8453-2378
Current Organisations
National Research and Innovation Agency
,
University Medical Center of the Johannes Gutenberg University Mainz
,
Commonwealth Scientific and Industrial Research Organisation
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Research Topics
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Top 5 Research Topics
ANZSRC Field of Research (FoR)
Data Security | Data Format | Data Encryption | Analysis Of Algorithms And Complexity | Detection And Prevention Of Crime; Security Services | Computation Theory And Mathematics Not Elsewhere Classified | Other Artificial Intelligence | Computation Theory and Mathematics | Computer Communications Networks | Information Systems | Computer System Security | Data Encryption | Text Processing | Communications Technologies | Information Systems Management | Criminology | Interdisciplinary Engineering Not Elsewhere Classified | Research, Science And Technology Policy | Interdisciplinary Engineering | Law Not Elsewhere Classified | Coding And Information Theory | Global Information Systems
ANZSRC Socio-Economic Objective (SEO)
Information processing services | Telecommunications | Application packages | Application tools and system utilities | Computer software and services not elsewhere classified | Technological and organisational innovation | Computer Software and Services not elsewhere classified | Other | Communication services not elsewhere classified |
Related Links
Publications
Special issue on trust and security in wireless sensor networks
Publisher: Wiley
Date: 20-05-2015
DOI: 10.1002/CPE.3497
Permutation generators of alternating groups
Publisher: Springer Berlin Heidelberg
Date: 1990
DOI: 10.1007/BFB0030365
Democratic Systems
Publisher: Springer Berlin Heidelberg
Date: 2001
LOKI — A cryptographic primitive for authentication and secrecy applications
Publisher: Springer-Verlag
Date: 1990
DOI: 10.1007/BFB0030364
Rotational Cryptanalysis of ARX Revisited
Publisher: Springer Berlin Heidelberg
Date: 2015
Resource-saving quantum key distribution based on three-photon matrix product states
Publisher: Springer Science and Business Media LLC
Date: 07-06-2023
Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes
Publisher: Springer Science and Business Media LLC
Date: 24-11-2013
Analysis of bilinear pairing-based accumulator for identity escrowing
Publisher: Institution of Engineering and Technology (IET)
Date: 2008
Randomized Authentication Systems
Publisher: Springer Berlin Heidelberg
Date: 1991
Securing Multicast Groups in Ad Hoc Networks
Publisher: Springer Berlin Heidelberg
Date: 2004
A Quantum Secret Sharing Scheme Using Orbital Angular Momentum onto Multiple Spin States Based on Fibonacci Compression Encoding
Publisher: IOP Publishing
Date: 10-2018
Verifiable Secret Sharing and Time Capsules
Publisher: Springer Berlin Heidelberg
Date: 2000
DOI: 10.1007/10719994_14
Transformer-Based Language Models for Software Vulnerability Detection
Publisher: arXiv
Date: 2022
Compcrypt-Lightweight ANS-Based Compression and Encryption
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Conditionally secure secret sharing schemes with disenrollment capability
Publisher: ACM Press
Date: 1994
Permutation polynomials of the form (
Publisher:
Elsevier BV
Date:
04-2008
Publisher: Elsevier BV
Date: 04-2008
Evaluating the performance of the practical lattice reduction algorithms
Publisher: IEEE
Date: 12-2014
Changing Emotions
Publisher: Psychology Press
Date: 15-02-2013
Special Issue on the Design and Engineering of Cryptographic Solutions for Secure Information Systems
Publisher: Wiley
Date: 08-11-2012
DOI: 10.1002/SEC.646
A subexponential construction of graph coloring for multiparty computation
Publisher: Walter de Gruyter GmbH
Date: 23-07-2014
Abstract: We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any t n 2 $t & \\frac{n}{2}$ inputs) and has subexponential complexity of construction based on coloring of planar graphs. More specifically, following the result of Desmedt et al. (2012) that the problem of MPC over non-Abelian groups can be reduced to finding a t -reliable n -coloring of planar graphs, we show the construction of such a graph which allows a path from the input nodes to the output nodes when any t -party subset is in the possession of the adversary. Unlike the deterministic constructions from Desmedt et al. (2012) our construction has subexponential complexity and is optimal at the same time, i.e., it is secure for any t n 2 $t & \\frac{n}{2}$ .
New security notions and relations for public-key encryption
Publisher: Walter de Gruyter GmbH
Date: 12-2012
Abstract: Since their introduction, the notions of indistinguishability and non-malleability have been changed and extended by different authors to support different goals. In this paper, we propose new flavors of these notions, investigate their relative strengths with respect to previous notions, and provide the full picture of relationships (i.e., implications and separations) among the security notions for public-key encryption schemes. We take into account the two general security goals of indistinguishability and non-malleability, each in the message space, key space, and hybrid message-key space to find six specific goals, a couple of them, namely complete indistinguishability and key non-malleability , are new. Then for each pair of goals, coming from the indistinguishability or non-malleability classes, we prove either an implication or a separation, completing the full picture of relationships among all these security notions. The implications and separations are respectively supported by formal proofs (i.e., reductions) in the concrete-security framework and by counterex les.
Protecting Web 2.0 Services from Botnet Exploitations
Publisher: IEEE
Date: 07-2010
DOI: 10.1109/CTC.2010.10
A new human identification protocol and Coppersmith's baby-step giant-step algorithm
Publisher: Springer Berlin Heidelberg
Date: 2010
Winning the Phishing War: A Strategy for Australia
Publisher: IEEE
Date: 07-2010
DOI: 10.1109/CTC.2010.13
A model of authorization for object-oriented databases based on object views
Publisher: Springer Berlin Heidelberg
Date: 1995
Lattice-based completely non-malleable public-key encryption in the standard model
Publisher: Springer Science and Business Media LLC
Date: 28-07-2012
Physical publicly verifiable randomness from pulsars
Publisher: Elsevier BV
Date: 2022
Lattice-Based Completely Non-malleable PKE in the Standard Model (Poster)
Publisher: Springer Berlin Heidelberg
Date: 2011
Probabilistic Analysis of Elementary Randomizers
Publisher: Springer Berlin Heidelberg
Date: 1991
Multiparty key agreement protocols
Publisher: Institution of Engineering and Technology (IET)
Date: 2000
Common Secure Index for Conjunctive Keyword-Based Retrieval over Encrypted Data
Publisher: Springer Berlin Heidelberg
Date: 2007
Characterising and predicting cyber attacks using the Cyber Attacker Model Profile (CAMP)
Publisher: Emerald
Date: 05-10-2012
DOI: 10.1108/13685201211266015
Abstract: Ethnographic studies of cyber attacks typically aim to explain a particular profile of attackers in qualitative terms. The purpose of this paper is to formalise some of the approaches to build a Cyber Attacker Model Profile (CAMP) that can be used to characterise and predict cyber attacks. The paper builds a model using social and economic independent or predictive variables from several eastern European countries and benchmarks indicators of cybercrime within the Australian financial services system. The paper found a very strong link between perceived corruption and GDP in two distinct groups of countries – corruption in Russia was closely linked to the GDP of Belarus, Moldova and Russia, while corruption in Lithuania was linked to GDP in Estonia, Latvia, Lithuania and Ukraine. At the same time corruption in Russia and Ukraine were also closely linked. These results support previous research that indicates a strong link between been legitimate economy and the black economy in many countries of Eastern Europe and the Baltic states. The results of the regression analysis suggest that a highly skilled workforce which is mobile and working in an environment of high perceived corruption in the target countries is related to increases in cybercrime even within Australia. It is important to note that the data used for the dependent and independent variables were gathered over a seven year time period, which included large economic shocks such as the global financial crisis. This is the first paper to use a modelling approach to directly show the relationship between various social, economic and demographic factors in the Baltic states and Eastern Europe, and the level of card skimming and card not present fraud in Australia.
Truncated Differential Analysis of Reduced-Round LBlock
Publisher: Springer International Publishing
Date: 2013
Dynamic hierarchical quantum secret sharing based on the multiscale entanglement renormalization ansatz
Publisher: American Physical Society (APS)
Date: 02-11-2022
Improvement of a Dynamic Accumulator at ICICS 07 and Its Application in Multi-user Keyword-Based Retrieval on Encrypted Data
Publisher: IEEE
Date: 12-2008
Homogeneous bent functions
Publisher: Elsevier BV
Date: 05-2000
The Security of “2FLIP” Authentication Scheme for VANETs: Attacks and Rectifications
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Multi-Party Computation with Omnipresent Adversary
Publisher: Springer Berlin Heidelberg
Date: 2009
Inspiring Technologies for Digital Inclusivity - Preface
Publisher: National Institute of Telecommunications
Date: 31-03-2022
Analysing recursive preprocessing of BKZ lattice reduction algorithm
Publisher: Institution of Engineering and Technology (IET)
Date: 03-2017
JPEG Image Steganalysis Improvement Via Image-to-Image Variation Minimization
Publisher: IEEE
Date: 12-2008
A Low-Cost Attack on Branch-Based Software Watermarking Schemes
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11922841_23
Parallel Signcryption
Publisher: Springer Berlin Heidelberg
Date: 2010
Efficient Fuzzy Matching and Intersection on Private Datasets
Publisher: Springer Berlin Heidelberg
Date: 2010
Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
Publisher: Springer Berlin Heidelberg
Date: 2008
Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures
Publisher: Springer Berlin Heidelberg
Date: 2004
Signcryption schemes with insider security in an ideal permutation model
Publisher: Walter de Gruyter GmbH
Date: 15-05-2019
Abstract: Signcryption aims to provide both confidentiality and authentication of messages more efficiently than performing encryption and signing independently. The “Commit-then-Sign & Encrypt” (CtS& E) method allows to perform encryption and signing in parallel. Parallel execution of cryptographic algorithms decreases the computation time needed to signcrypt messages. CtS& E uses weaker cryptographic primitives in a generic way to achieve a strong security notion of signcryption. Various message pre-processing schemes, also known as message padding, have been used in signcryption as a commitment scheme in CtS& E. Due to its elegance and versatility, the sponge structure turns out to be a useful tool for designing new padding schemes such as SpAEP [T. K. Bansal, D. Chang and S. K. Sanadhya, Sponge based CCA2 secure asymmetric encryption for arbitrary length message, Information Security and Privacy – ACISP 2015, Lecture Notes in Comput. Sci. 9144, Springer, Berlin 2015, 93–106], while offering further avenues for optimization and parallelism in the context of signcryption. In this work, we design a generic and efficient signcryption scheme featuring parallel encryption and signature on top of a sponge-based message-padding underlying structure. Unlike other existing schemes, the proposed scheme also supports arbitrarily long messages. We prove the construction secure when instantiated from weakly secure asymmetric primitives such as a trapdoor one-way encryption and a universal unforgeable signature. With a careful analysis and simple tweaks, we demonstrate how different combinations of weakly secure probabilistic and deterministic encryption and signature schemes can be used to construct a strongly secure signcryption scheme, further broadening the choices of underlying primitives to cover essentially any combination thereof. To the best of our knowledge, this is the first signcryption scheme based on the sponge structure that also offers strong security using weakly secure underlying asymmetric primitives, even deterministic ones, along with the ability to handle long messages, efficiently.
Uncovering generalized patterns of brand competition in China
Publisher: Emerald
Date: 11-11-2014
DOI: 10.1108/JPBM-04-2014-0557
Abstract: – The purpose of this research is to analyze brand competition in China using the Duplication of Purchase (DoP) law, with important implications for understanding Chinese buyer behavior in comparison with Western buyers. Discovered in the Western markets, the DoP law holds across a variety of product categories. – Multiple sets of new data are examined to extend past research in the application of the DoP law in Chinese buying behavior. This study draws on panel data and self-reported data, utilizing bootstrapping to identify partitions where excess sharing occurs. – This paper finds the DoP law holds across six categories (two personal care, two impulse categories and two durables), as well as over multiple years. Brands in China share customers with other brands in line with the market share of the competitor brand. There were few partitions where brands shared significantly more customers than expected. Partitions occur due to the same umbrella brand or ownership, and geographic location. – Areas for further research include extended replication in other categories, investigating partitions and whether a different consumer path to purchase occurs in China. – DoP can be applied across a wide range of categories in China to understand market structure. New entrants to China can use this approach to understand a category from a consumer behavior perceptive. DoP provides guidelines for marketers to identify competition and allocate resources appropriately. – This research provides a comprehensive, unparalleled examination across six very different categories of brand competition in China. This gives confidence in the robustness and generalizability of the results.
Efficient Disjointness Tests for Private Datasets
Publisher: Springer Berlin Heidelberg
Date: 2008
Taxonomy and Control Measures of SPAM and SPIM
Publisher: Springer Berlin Heidelberg
Date: 2012
Cheating Prevention in Linear Secret Sharing
Publisher: Springer Berlin Heidelberg
Date: 2002
Trapdoor Delegation and HIBE from Middle-Product LWE in Standard Model
Publisher: arXiv
Date: 2020
A differential fault attack on the WG family of stream ciphers
Publisher: Springer Science and Business Media LLC
Date: 31-03-2020
Ideal Threshold Schemes from Orthogonal Arrays
Publisher: Springer Berlin Heidelberg
Date: 2002
Error propagation property and application in cryptography
Publisher: Institution of Engineering and Technology (IET)
Date: 1989
An improved coding method of quantum key distribution protocols based on Fibonacci-valued OAM entangled states
Publisher: Elsevier BV
Date: 09-2017
ANS-based compression and encryption with 128-bit security
Publisher: Springer Science and Business Media LLC
Date: 13-07-2022
DOI: 10.1007/S10207-022-00597-4
Abstract: The bulk of Internet interactions is highly redundant and also security sensitive. To reduce communication bandwidth and provide a desired level of security, a data stream is first compressed to squeeze out redundant bits and then encrypted using authenticated encryption. This generic solution is very flexible and works well for any pair of (compression, encryption) algorithms. Its downside, however, is the fact that the two algorithms are designed independently. One would expect that designing a single algorithm that compresses and encrypts (called compcrypt) should produce benefits in terms of efficiency and security. The work investigates how to design a compcrypt algorithm using the ANS entropy coding. First, we examine basic properties of ANS and show that a plain ANS with a hidden encoding table can be broken by statistical attacks. Next, we study ANS behavior when its states are chosen at random. Our compcrypt algorithm is built using ANS with randomized state jumps and a sponge MonkeyDuplex encryption. Its security and efficiency are discussed. The design provides 128-bit security for both confidentiality and integrity/authentication. Our implementation experiments show that our compcrypt algorithm processes symbols with a rate up to 269 MB/s (with a slight loss of compression rate) 178 MB/s.
Modular design of information encipherment for computer systems
Publisher: Elsevier BV
Date: 09-1985
Forward and Backward Private DSSE for Range Queries
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Binary Image Steganographic Techniques Classification Based on Multi-class Steganalysis
Publisher: Springer Berlin Heidelberg
Date: 2010
Lattice-based certificateless public-key encryption in the standard model
Publisher: Springer Science and Business Media LLC
Date: 10-12-2013
A Construction for One Way Hash Functions and Pseudorandom Bit Generators
Publisher: Springer Berlin Heidelberg
Date: 1991
Dynamic Searchable Symmetric Encryption Schemes Supporting Range Queries with Forward (and Backward) Security
Publisher: Springer International Publishing
Date: 2018
Authentication of Concast Communication
Publisher: Springer Berlin Heidelberg
Date: 2002
Lattice Blind Signatures with Forward Security
Publisher: arXiv
Date: 2020
Cryptanalysis of the Convex Hull Click Human Identification Protocol
Publisher: Springer Berlin Heidelberg
Date: 2011
Cheating Prevention in Secret Sharing
Publisher: Springer Berlin Heidelberg
Date: 2000
DOI: 10.1007/10718964_27
Authenticating Multicast Streams in Lossy Channels Using Threshold Techniques
Publisher: Springer Berlin Heidelberg
Date: 2001
A large-alphabet three-party quantum key distribution protocol based on orbital and spin angular momenta hybrid entanglement
Publisher: Springer Science and Business Media LLC
Date: 18-05-2018
Optimal perfect randomizers
Publisher: Springer Berlin Heidelberg
Date: 1993
A general purpose technique for locating key scheduling weaknesses in DES-like cryptosystems
Publisher: Springer Berlin Heidelberg
Date: 1993
On necessary and sufficient conditions for the construction of super pseudorandom permutations
Publisher: Springer Berlin Heidelberg
Date: 1993
Unconditionally secure disjointness tests for private datasets
Publisher: Inderscience Publishers
Date: 2009
Lattice Blind Signatures with Forward Security
Publisher: Springer International Publishing
Date: 2020
How to Construct Pseudorandom Permutations from Single Pseudorandom Functions
Publisher: Springer Berlin Heidelberg
Date: 1991
Security analysis of linearly filtered NLFSRs
Publisher: Walter de Gruyter GmbH
Date: 12-2013
Abstract: Non-linear feedback shift register (NLFSR) ciphers are cryptographic tools of choice of the industry especially for mobile communication. Their attractive feature is a high efficiency when implemented in hardware or software. However, the main problem of NLFSR ciphers is that their security is still not well investigated. The paper makes a progress in the study of the security of NLFSR ciphers. In particular, we show a distinguishing attack on linearly filtered NLFSR (or LF-NLFSR) ciphers. We extend the attack to a linear combination of LF-NLFSRs. We investigate the security of a modified version of the Grain stream cipher and show its vulnerability to both key recovery and distinguishing attacks.
Controllable quantum private queries using an entangled Fibonacci-sequence spiral source
Publisher: Elsevier BV
Date: 10-2015
Two types of dynamic quantum state secret sharing based on tensor networks states
Publisher: Elsevier BV
Date: 11-2021
Rotation-symmetric functions and fast hashing
Publisher: Springer Berlin Heidelberg
Date: 1998
DOI: 10.1007/BFB0053731
Cube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
Publisher: Springer Berlin Heidelberg
Date: 2015
On Algebraic Immunity and Annihilators
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11927587_8
Active Security in Multiparty Computation over Black-Box Groups
Publisher: Springer Berlin Heidelberg
Date: 2012
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
Publisher: Springer Berlin Heidelberg
Date: 2002
ALI: Anonymous Lightweight Inter-Vehicle Broadcast Authentication with Encryption
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Dual compressible hybrid quantum secret sharing schemes based on extended unitary operations
Publisher: SPIE
Date: 28-05-2014
DOI: 10.1117/12.2052886
Efficient quantum key distribution using Fibonacci-number coding with a biased basis choice
Publisher: Elsevier BV
Date: 06-2018
RSA-based fail-stop signature schemes
Publisher: IEEE
Date: 1999
Authentication strategies in vehicular communications: a taxonomy and framework
Publisher: Springer Science and Business Media LLC
Date: 21-05-2021
DOI: 10.1186/S13638-021-01968-6
Abstract: In intelligent vehicular networks, vehicles have enhanced sensing capabilities and carry computing and communication platforms to enable new versatile systems known as Vehicular Communication (VC) systems. Vehicles communicate with other vehicles and with nearby fixed equipment to support different applications, including those which increase driver awareness of the surroundings. This should result in improved safety and may optimize traffic. However, VC systems are vulnerable to cyber attacks involving message manipulation. Research aimed at tackling this problem has resulted in the proposal of multiple authentication protocols. Several existing survey papers have attempted to classify some of these protocols based on a limited set of characteristics. However, to date there is no generic framework to support the comparison of these protocols and provide guidance for design and evaluation. Most existing classifications either use computation complexity of cryptographic techniques as a criterion, or they fail to make connections between different important aspects of authentication. This paper provides such a framework, proposing a new taxonomy to enable a consistent means of classifying authentication schemes based upon seven main criteria. The main contribution of this study is a framework to enable protocol designers and investigators to adequately compare and select authentication schemes when deciding on particular protocols to implement in an application. Our framework can be applied in design, making choices appropriate for the intended context in both intra-vehicle and inter-vehicle communications. We demonstrate the application of our framework using two different types of case study: in idual analysis and hypothetical design. Additionally, this work makes several related contributions. We present the network model, outline the applications, list the communication patterns and the underlying standards, and discuss the necessity of using cryptography and key management in VC systems. We also review the threats, authentication, and privacy requirements in vehicular networks.
Differential fault attacks on the lightweight authenticated encryption algorithm CLX-128
Publisher: Springer Science and Business Media LLC
Date: 26-06-2023
S‐boxes representation and efficiency of algebraic attack
Publisher: Institution of Engineering and Technology (IET)
Date: 09-2019
Sibling intractable function families and their applications
Publisher: Springer Berlin Heidelberg
Date: 1993
Cheating Prevention in Secret Sharing over GF(p t)
Publisher: Springer Berlin Heidelberg
Date: 2001
Cheating Immune Secret Sharing
Publisher: Springer Berlin Heidelberg
Date: 2001
Non-linearity of Exponent Permutations
Publisher: Springer Berlin Heidelberg
Date: 1990
Multiple Modular Additions and Crossword Puzzle Attack on NLSv2
Publisher: Springer Berlin Heidelberg
Date: 2007
Investigating cube attacks on the authenticated encryption stream cipher ACORN
Publisher: Springer Singapore
Date: 2016
Early Inner Retinal Astrocyte Dysfunction during Diabetes and Development of Hypoxia, Retinal Stress, and Neuronal Functional Loss
Publisher: Association for Research in Vision and Ophthalmology (ARVO)
Date: 02-12-2011
DOI: 10.1167/IOVS.11-7879
Abstract: Neuronal and glial alterations precede the overt vascular change that characterizes diabetic retinopathy. Because retinal astrocytes modulate neuronal and vascular function, this study investigated the time course of astrocyte, Müller cell, and neuronal change during diabetes to determine whether astrocytes may play an early role in diabetic retinopathy. Sprague-Dawley rats were rendered diabetic via streptozotocin and neuronal and glial changes were assessed after 2-10 weeks. Astrocyte change was investigated using connexin-26 immunolabeling, whereas connexin-26 and -43 gene expressions were quantified using real-time PCR. Hypoxia was measured by pimonidazole labeling and the expression of hypoxia-inducible factor-1 alpha (HIF-1α) was quantified using Western blot. Müller cell gliosis was assessed by glial fibrillary acidic protein immunolabeling and retinal function assessed using the electroretinogram. Astrocyte connexin-26 and -43 gene and protein expression decreased after 4 weeks of diabetes, before significant astrocyte loss. At the same time, the retina became hypoxic, with increased HIF-1α expression and pimonidazole labeling in the ganglion cell layer. This coincided with a decrease in ganglion cell function. After 6 weeks of diabetes, Müller cell gliosis became more evident and there were additional functional deficits in photoreceptoral and amacrine cell responses. These findings suggest that early changes in astrocytes are coincident with inner retinal hypoxia and ganglion cell functional deficits, whereas Müller cell gliosis and more extensive decreases in neuronal function occur later. Astrocytes may play an early and key role in changes in retinal vasculature and inner retinal dysfunction in diabetes.
Features-Pooling Blind JPEG Image Steganalysis
Publisher: IEEE
Date: 2008
A cryptographic mechanism for object-instance-based authorization in object-oriented database systems
Publisher: Springer Berlin Heidelberg
Date: 1995
DOI: 10.1007/BFB0020519
An efficient quantum blind digital signature scheme
Publisher: Springer Science and Business Media LLC
Date: 10-07-2017
Constructions of Cheating Immune Secret Sharing
Publisher: Springer Berlin Heidelberg
Date: 2002
Universal Designated-Verifier Signatures
Publisher: Springer Berlin Heidelberg
Date: 2003
An On-Line Secure E-Passport Protocol
Publisher: Springer Berlin Heidelberg
Date: 2008
Efficient One-Time Proxy Signatures
Publisher: Springer Berlin Heidelberg
Date: 2003
Reversible And Blind Database Watermarking Using Difference Expansion
Publisher: ACM
Date: 2008
Advances in security research in the Asiacrypt region
Publisher: Association for Computing Machinery (ACM)
Date: 20-03-2020
DOI: 10.1145/3378428
Abstract: Members of the International Association for Cryptologic Research explore regional work and collaboration activities.
Threshold Privacy Preserving Keyword Searches
Publisher: Springer Berlin Heidelberg
Date: 2008
Broadcast anti-jamming systems
Publisher: IEEE Comput. Soc
Date: 1999
Copyright Protection of Object-Oriented Software
Publisher: Springer Berlin Heidelberg
Date: 2002
Trapdoor Delegation and HIBE from Middle-Product LWE in Standard Model
Publisher: Springer International Publishing
Date: 2020
Known and Chosen Key Differential Distinguishers for Block Ciphers
Publisher: Springer Berlin Heidelberg
Date: 2011
On construction of cumulative secret sharing schemes
Publisher: Springer Berlin Heidelberg
Date: 1998
DOI: 10.1007/BFB0053749
Secret sharing in multilevel and compartmented groups
Publisher: Springer Berlin Heidelberg
Date: 1998
DOI: 10.1007/BFB0053748
On the hardness of the sum of k mins problem
Publisher: Oxford University Press (OUP)
Date: 27-07-2011
Case-based reasoning for intrusion detection
Publisher: IEEE Comput. Soc. Press
Date: 1996
A New Dynamic Accumulator for Batch Updates
Publisher: Springer Berlin Heidelberg
Date: 2007
Design of public key cryptosystems using idempotent elements
Publisher: Elsevier BV
Date: 12-1985
A Strong Lightweight Authentication Protocol for Low-cost RFID Systems
Publisher: NADIA
Date: 30-11-2014
Low Probability Differentials and the Cryptanalysis of Full-Round CLEFIA-128
Publisher: Springer Berlin Heidelberg
Date: 2014
Cryptanalysis of FORK-256
Publisher: Springer Berlin Heidelberg
Date: 2007
Security Evaluation of Rakaposhi Stream Cipher
Publisher: Springer Berlin Heidelberg
Date: 2013
Novel quantum key distribution with shift operations based on Fibonacci and Lucas valued orbital angular momentum entangled states
Publisher: Elsevier BV
Date: 09-2020
State recovery attacks against π-cipher
Publisher: ACM
Date: 02-2016
Robust Numeric Set Watermarking: Numbers Don’t Lie
Publisher: Springer Berlin Heidelberg
Date: 2011
Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups
Publisher: Springer Berlin Heidelberg
Date: 2008
Guidelines for the use and interpretation of assays for monitoring autophagy
Publisher: Informa UK Limited
Date: 04-2012
DOI: 10.4161/AUTO.19496
Privacy Enhancements for Hardware-Based Security Modules
Publisher: Springer Berlin Heidelberg
Date: 2011
Finding state collisions in the authenticated encryption stream cipher ACORN
Publisher: ACM
Date: 02-2016
Puncturable Encryption: A Generic Construction from Delegatable Fully Key-Homomorphic Encryption
Publisher: Springer International Publishing
Date: 2020
Round-robin-differential-phase-shift quantum key distribution based on wavelength division multiplexing
Publisher: IOP Publishing
Date: 04-09-2018
A Model to Evaluate Reliability of Authentication Protocols in C-ITS Safety-Critical Applications
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2021
Source Code Watermarking Based on Function Dependency Oriented Sequencing
Publisher: IEEE
Date: 08-2008
Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding
Publisher: Springer Science and Business Media LLC
Date: 12-08-2016
DOI: 10.1038/SREP31350
Abstract: With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m -bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m -bonacci sequences to detect eavesdropping. Meanwhile, we encode m -bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.
A survey: Error control methods used in bio-cryptography
Publisher: IEEE
Date: 08-2014
Shared generation of pseudo-random functions
Publisher: Elsevier BV
Date: 04-2006
A message authentication code based on latin squares
Publisher: Springer Berlin Heidelberg
Date: 1997
DOI: 10.1007/BFB0027926
Distinguishing Attack on SOBER-128 with Linear Masking
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11780656_3
Puncturable Encryption: A Generic Construction from Delegatable Fully Key-Homomorphic Encryption
Publisher: arXiv
Date: 2020
Practical attack on NLM-MAC scheme
Publisher: Elsevier BV
Date: 10-2014
Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks
Publisher: Springer Berlin Heidelberg
Date: 2004
A hybrid quantum key distribution protocol based on extended unitary operations and fountain codes
Publisher: Springer Science and Business Media LLC
Date: 31-10-2014
Improving resistance to differential cryptanalysis and the redesign of LOKI
Publisher: Springer Berlin Heidelberg
Date: 1993
How to construct a family of strong one way permutations
Publisher: Springer Berlin Heidelberg
Date: 1993
Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding
Publisher: IOP Publishing
Date: 11-2016
Privacy Enhanced Electronic Cheque System
Publisher: IEEE
Date: 2005
Linear Secret Sharing with Divisible Shares
Publisher: Springer Berlin Heidelberg
Date: 1999
A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function
Publisher: Springer Berlin Heidelberg
Date: 1993
Ideal Threshold Schemes from MDS Codes
Publisher: Springer Berlin Heidelberg
Date: 2003
On Secure Multi-party Computation in Black-Box Groups
Publisher: Springer Berlin Heidelberg
Date: 2007
An Ideal and Robust Threshold RSA
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11958239_21
Welcome Message from the CTC 2014 Steering Committee
Publisher: IEEE
Date: 11-2014
DOI: 10.1109/CTC.2014.4
High-capacity (2,3) threshold quantum secret sharing based on asymmetric quantum lossy channels
Publisher: Springer Science and Business Media LLC
Date: 31-03-2020
Broadcast anti-jamming systems
Publisher: Elsevier BV
Date: 02-2001
Towards effective nonlinear cryptosystem design
Publisher: Institution of Engineering and Technology (IET)
Date: 1988
Analysis of weighted quantum secret sharing based on matrix product states
Publisher: Springer Science and Business Media LLC
Date: 17-11-2020
A Non-malleable Group Key Exchange Protocol Robust Against Active Insiders
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11836810_33
An attack-localizing watermarking scheme for natural language documents
Publisher: ACM
Date: 21-03-2006
Linear nonequivalence versus nonlinearity
Publisher: Springer Berlin Heidelberg
Date: 1993
Socio-economic, demographic, and environmental determinants of under-five mortality in Indonesia: insights from a national survey
Publisher: IOP Publishing
Date: 06-2022
DOI: 10.1088/1755-1315/977/1/012104
Abstract: Despite great improvements in childhood mortality in the past several decades, many Indonesian children did not surpass their fifth birthday. This paper investigates the social and environmental determinants of under-five (U-5) mortality in Indonesia. By utilising the most recent Indonesia Demographic and Health Survey (IDHS) in 2017, we fitted survival regression models to the data. We observed that maternal smoking (aHR = 2.15, 95% CI = 1.15–4.03), maternal age (aHR = 2.48, 95% CI = 1.43–4.30), and maternal employment status (aHR = 1.68, 95% CI = 1.34–2.11) correspond to shorter lives of U-5 children. Conversely, we found that higher maternal education (aHR = 0.50, 95% CI = 0.29–0.87) corresponds to better child survival. Improved household sanitation also negatively associated with child mortality, albeit statistically insignificant at 5% (aHR = 0.78, 95% CI = 0.60–1.01). These associations hold after we take into account proximate and biological correlates. These findings corroborate extant literature that living environment (not only socio-economic and demographic factors) plays a prominent role in determining child survival. Hence, increasing access to and reducing the rural-urban gap related to improved sanitation facilities and curtailing smoking prevalence are paramount in further curbing child mortality.
Temperature and size effects on the amplitude of atomic vibration of Co nanocrystals embedded in Ag matrix
Publisher: Elsevier BV
Date: 05-2007
Evidential reasoning in network intrusion detection systems
Publisher: Springer Berlin Heidelberg
Date: 1996
DOI: 10.1007/BFB0023304
Cryptosystems for hierarchical groups
Publisher: Springer Berlin Heidelberg
Date: 1996
DOI: 10.1007/BFB0023306
Graph Coloring Applied to Secure Computation in Non-Abelian Groups
Publisher: Springer Science and Business Media LLC
Date: 06-09-2011
On selectable collisionful hash functions
Publisher: Springer Berlin Heidelberg
Date: 1996
DOI: 10.1007/BFB0023307
On-the-fly web content integrity check boosts users' confidence
Publisher: Association for Computing Machinery (ACM)
Date: 11-2002
Abstract: Malicious attacks on Web servers by intruders and hackers are prime concerns of organizations, administrators of Web sites, as well as users who access them.
On password-based authenticated key exchange using collisionful hash functions
Publisher: Springer Berlin Heidelberg
Date: 1996
DOI: 10.1007/BFB0023308
Cryptanalysis of WG-8 and WG-16 stream ciphers
Publisher: Springer Science and Business Media LLC
Date: 13-04-2018
Lattice-based ABE-IBE Proxy Re-Encryption for IoT Systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 16-03-2022
DOI: 10.36227/TECHRXIV.19350680
Abstract: The recent expansion of the Internet of things (IoT) and its applications continues to dramatically change the IT services supporting manufacturing, energy management, intelligent transportation, smart cities, etc. These IT services often interconnect Internet-based Cloud systems with IoT or intelligent smart devices held by organisations. As IoT devices are resource-limited, the security of their communication is provided by lightweight cryptography that could consequently lead to the devices being insecure against a quantum adversary. On the other hand, Internet Cloud systems are resource-rich and could easily support post-quantum cryptography. This paper presents a proxy re-encryption scheme that translates ciphertexts of a classical lightweight encryption algorithm into their post quantum equivalent and vice versa. More precisely, we propose a lattice-based ABE-IBE (L ABE-IBE) proxy re-encryption scheme that transforms a classical lightweight ciphertext into a lattice based ciphertext. We compare our proposed L ABE-IBE proxy re-encryption scheme with classical proxy re-encryption (ABEIBE) schemes. We discuss the security and efficiency of our construction. /
Cryptanalysis of the LAKE Hash Family
Publisher: Springer Berlin Heidelberg
Date: 2009
High-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding
Publisher: Springer Science and Business Media LLC
Date: 19-08-2016
An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
Publisher: Springer Berlin Heidelberg
Date: 2007
Reversible and Blind Database Watermarking Using Difference Expansion
Publisher: IGI Global
Date: 04-2009
Abstract: There has been significant research in the field of database watermarking recently. However, there has not been sufficient attention given to the requirement of providing reversibility (the ability to revert back to original relation from watermarked relation) and blindness (not needing the original relation for detection purpose) at the same time. This model has several disadvantages over reversible and blind watermarking (requiring only the watermarked relation and secret key from which the watermark is detected and the original relation is restored) including the inability to identify the rightful owner in case of successful secondary watermarking, the inability to revert the relation to the original data set (required in high precision industries) and the requirement to store the unmarked relation at a secure secondary storage. To overcome these problems, we propose a watermarking scheme that is reversible as well as blind. We utilize difference expansion on integers to achieve reversibility. The major advantages provided by our scheme are reversibility to a high quality original data set, rightful owner identification, resistance against secondary watermarking attacks, and no need to store the original database at a secure secondary storage. We have implemented our scheme and results show the success rate is limited to 11% even when 48% tuples are modified.
Algebraical Structures of Cryptographic Transformations
Publisher: Springer Berlin Heidelberg
Date: 1985
Cube attacks on round-reduced TinyJAMBU
Publisher: Springer Science and Business Media LLC
Date: 29-03-2022
DOI: 10.1038/S41598-022-09004-3
Abstract: Lightweight cryptography has recently gained importance as the number of Internet of things (IoT) devices connected to Internet grows. Its main goal is to provide cryptographic algorithms that can be run efficiently in resource-limited environments such as IoT. To meet the challenge, the National Institute of Standards and Technology (NIST) announced the Lightweight Cryptography (LWC) project. One of the finalists of the project is the TinyJAMBU cipher. This work evaluates the security of the cipher. The tool used for the evaluation is the cube attack. We present five distinguishing attacks DA1–DA5 and two key recovery attacks KRA1–KRA2. The first two distinguishing attacks (DA1 and DA2) are launched against the initialisation phase of the cipher. The best result achieved for the attacks is a distinguisher for an 18-bit cube, where the cipher variant consists of the full initialisation phase together with 438 rounds of the encryption phase. The key recovery attacks (KRA1 and KRA2) are also launched against the initialisation phase of the cipher. The best key recovery attack can be applied for a cipher variant that consists of the full initialisation phase together with 428 rounds of the encryption phase. The attacks DA3–DA5 present a collection of distinguishers up to 437 encryption rounds, whose 32-bit cubes are chosen from the plaintext, nonce, or associated data bits. The results are confirmed experimentally. A conclusion from the work is that TinyJAMBU has a better security margin against cube attacks than claimed by the designers.
Fingerprints for Copyright Software Protection
Publisher: Springer Berlin Heidelberg
Date: 1999
Extensions of the Cube Attack Based on Low Degree Annihilators
Publisher: Springer Berlin Heidelberg
Date: 2009
Broadcast Authentication in Latency-Critical Applications: On the Efficiency of IEEE 1609.2
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2019
P2DPI: Practical and Privacy-Preserving Deep Packet Inspection
Publisher: ACM
Date: 24-05-2021
Investigating Cube Attacks on the Authenticated Encryption Stream Cipher MORUS
Publisher: IEEE
Date: 08-2017
Optimizing preprocessing method of recursive-BKZ lattice reduction algorithm
Publisher: IEEE
Date: 12-2015
ICEPOLE: High-Speed, Hardware-Oriented Authenticated Encryption
Publisher: Springer Berlin Heidelberg
Date: 2014
Converse Results to the Wiener Attack on RSA
Publisher: Springer Berlin Heidelberg
Date: 2005
A multi-level view model for secure object-oriented databases
Publisher: Elsevier BV
Date: 08-1997
Algebraic Attacks on SOBER-t32 and SOBER-t16 without Stuttering
Publisher: Springer Berlin Heidelberg
Date: 2004
Predicting tours and probabilistic simulation for BKZ lattice reduction algorithm
Publisher: IEEE
Date: 10-2014
Welcome Message from the CTC Steering Committee
Publisher: IEEE
Date: 11-2013
DOI: 10.1109/CTC.2013.4
Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2007
An improved quantum network communication model based on compressed tensor network states
Publisher: Springer Science and Business Media LLC
Date: 26-07-2022
Efficient quantum private queries based on quantum key distribution with pulse-position modulation
Publisher: IOP Publishing
Date: 26-03-2019
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11967668_23
Homogeneous bent functions of degree n in 2n variables do not exist for n>3
Publisher: Elsevier BV
Date: 08-2004
Dynamic (2, 3) Threshold Quantum Secret Sharing of Secure Direct Communication*
Publisher: IOP Publishing
Date: 04-2015
DOI: 10.1088/0253-6102/63/4/459
Abstract: In this paper, we show that a (2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.
Identifying Steganographic Payload Location in Binary Image
Publisher: Springer Berlin Heidelberg
Date: 2010
On the (In)Security of IDEA in Various Hashing Modes
Publisher: Springer Berlin Heidelberg
Date: 2012
An Efficient Authentication Scheme for Intra-vehicular Controller Area Network
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Guidelines for the use and interpretation of assays for monitoring autophagy (3rd edition)
Publisher: Informa UK Limited
Date: 02-01-2016
A coding approach to the multicast stream authentication problem
Publisher: Springer Science and Business Media LLC
Date: 20-09-2007
Multi-party computation with conversion of secret sharing
Publisher: Springer Science and Business Media LLC
Date: 10-05-2012
Cryptanalysis of WG-7: a lightweight stream cipher
Publisher: Springer Science and Business Media LLC
Date: 23-08-2012
Cryptanalysis of RC4(n, m) stream cipher
Publisher: ACM
Date: 26-11-2013
Lattice-based threshold-changeability for standard CRT secret-sharing schemes
Publisher: Elsevier BV
Date: 11-2006
Lattice-based ABE-IBE Proxy Re-Encryption for IoT Systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 16-03-2022
DOI: 10.36227/TECHRXIV.19350680.V1
Abstract: The recent expansion of the Internet of things (IoT) and its applications continues to dramatically change the IT services supporting manufacturing, energy management, intelligent transportation, smart cities, etc. These IT services often interconnect Internet-based Cloud systems with IoT or intelligent smart devices held by organisations. As IoT devices are resource-limited, the security of their communication is provided by lightweight cryptography that could consequently lead to the devices being insecure against a quantum adversary. On the other hand, Internet Cloud systems are resource-rich and could easily support post-quantum cryptography. This paper presents a proxy re-encryption scheme that translates ciphertexts of a classical lightweight encryption algorithm into their post quantum equivalent and vice versa. More precisely, we propose a lattice-based ABE-IBE (L ABE-IBE) proxy re-encryption scheme that transforms a classical lightweight ciphertext into a lattice based ciphertext. We compare our proposed L ABE-IBE proxy re-encryption scheme with classical proxy re-encryption (ABEIBE) schemes. We discuss the security and efficiency of our construction. /
Novel entanglement compression for QKD protocols using isometric tensors
Publisher: Springer Science and Business Media LLC
Date: 26-06-2023
Digital Immunity Module: Preventing Unwanted Encryption using Source Coding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-01-2022
DOI: 10.36227/TECHRXIV.17789735.V1
Abstract: Unwanted data encryption, such as ransomware attacks, continues to be a significant cybersecurity threat. Ransomware is a preferred weapon of cybercriminals who target small to large organizations' computer systems and data centres. It is malicious software that infects a victim's computer system and encrypts all its valuable data files. The victim needs to pay a ransom, often in cryptocurrency, in return for a decryption key. Many solutions use methods, including the inspection of file signatures, runtime process behaviors, API calls, and network traffic, to detect ransomware code. However, unwanted data encryption is still a top threat. This paper presents the first immunity solution, called the digital immunity module (DIM). DIM focuses on protecting valuable business-related data files from unwanted encryption rather than detecting malicious codes or processes. We show that methods such as file entropy and fuzzy hashing can be effectively used to sense unwanted encryption on a protected file, triggering our novel source coding method to paralyze the malicious manipulation of data such as ransomware encryption. Specifically, maliciously encrypted data blocks consume exponentially larger space and longer writing time on the DIM-protected file system. As a result, DIM creates enough time for system/human intervention and forensics analysis. Unlike the existing solutions, DIM protects the data regardless of ransomware families and variants. Additionally, DIM can defend against simultaneously active multiple ransomware, including the most recent hard to detect and stop fileless ones. We tested our solution on 39 ransomware families, including the most recent ransomware attacks. DIM successfully defended our s le file dataset (1335 pdf, jpg, and tiff files) against those ransomware attacks with zero file loss.
Use of standard risk screening and assessment forms to prevent harm to older people in Australian hospitals: a mixed methods study
Publisher: BMJ
Date: 13-03-2017
DOI: 10.1136/BMJQS-2016-005867
Abstract: Standard risk screening and assessment forms are frequently used in strategies to prevent harm to older people in hospitals. Little is known about good practices for their use. Scope the preventable harms addressed by standard forms used to screen and assess older people and how standard forms are operationalised in hospitals across Victoria, Australia. Mixed methods study: (1) cross-sectional audit of the standard risk screening and assessment forms used to assess older people at 11 health services in 2015 (2) nine focus groups with a purposive s le of 69 participants at 9 health services. Descriptive analysis examined the number of items on forms, preventable harms assessed and sources of duplication. Qualitative thematic analysis of focus group data identified themes explaining issues commonly affecting how health services used the forms. 152 standard assessment forms from 11 Victorian health services included over 3700 items with 17% duplicated across multiple forms. Assessments of skin integrity and mobility loss (including falls) were consistently included in forms however, nutrition, cognitive state, pain and medication risks were inconsistent and continence, venous thromboembolism risk and hospital acquired infection from invasive devices were infrequent. Qualitative analyses revealed five themes explaining issues associated with current use of assessment forms: (1) comprehensive assessment of preventable harms (2) burden on staff and the older person, (3) interprofessional collaboration, (4) flexibility to in idualise care and (5) information management. Ex les of good practice were identified. Current use of standard risk screening and assessment forms is associated with a high burden and gaps in assessment of several common preventable harms that can increase risk to older people in hospital. Improvement should focus on streamlining forms, increased guidance on interventions to prevent harm and facilitating front-line staff to manage complex decisions.
Cryptanalysis of the convex hull click human identification protocol
Publisher: Springer Science and Business Media LLC
Date: 30-10-2012
Secure Computation of the Vector Dominance Problem
Publisher: Springer Berlin Heidelberg
Date: 2008
Random Differential Fault Attacks on the Lightweight Authenticated Encryption Stream Cipher Grain-128AEAD
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Distributed Private Matching and Set Operations
Publisher: Springer Berlin Heidelberg
Date: 2008
Dynamic and compressed quantum many-body state secret sharing based on site-independent matrix product states
Publisher: Springer Science and Business Media LLC
Date: 17-02-2022
Finding Good Differential Patterns for Attacks on SHA-1
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11779360_14
Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions
Publisher: Informa UK Limited
Date: 05-2011
Changing Thresholds in the Absence of Secure Channels
Publisher: Springer Berlin Heidelberg
Date: 1999
Estimating Hidden Message Length in Binary Image Embedded by Using Boundary Pixels Steganography
Publisher: IEEE
Date: 02-2010
DOI: 10.1109/ARES.2010.65
Tunable multi-party high-capacity quantum key distribution based on m-generalized Fibonacci sequences using golden coding
Publisher: Springer Science and Business Media LLC
Date: 11-08-2018
An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Data
Publisher: Springer Berlin Heidelberg
Date: 2009
On the Efficiency of Pairing-Based Authentication for Connected Vehicles: Time is Not on Our Side!
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Blind Steganalysis: A Countermeasure for Binary Image Steganography
Publisher: IEEE
Date: 02-2010
DOI: 10.1109/ARES.2010.66
Repudiation of Cheating and Non-repudiation of Zhang’s Proxy Signature Schemes
Publisher: Springer Berlin Heidelberg
Date: 1999
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11935230_13
PSO-KS Algorithm for Fitting Lognormal Distribution: Simulation and Empirical Implementation to Women's Age at First Marriage Data
Publisher: IOP Publishing
Date: 06-2019
DOI: 10.1088/1757-899X/546/5/052052
Abstract: Lognormal distribution plays an essential role in the distribution modeling of right-skewed data in many areas. In social sciences, for instance, it can be used to model women’s age at first marriage pattern, a key indicator in studying fertility patterns. Distribution fitting is a fundamental and essential stage of data modeling before doing advancing the analysis. Kolmogorov-Smirnov (KS) distance is applicable as maximum goodness-of-fit (GOF) estimators for distribution parameters. Minimizing KS distance is optimization problem. Particle swarm optimization (PSO) algorithm is a general optimizer that can handle various optimization problems. This study assesses the characteristics of minimum KS distance estimator for lognormal distribution parameters. KS distance estimators were obtained via optimization using the PSO algorithm, so the combination of these is called the PSO-KS algorithm. We conducted a simulation to assess the performance of PSO-KS, Maximum Likelihood (MLE), Method of Moment (MME). The bias and mean square error (MSE) of point estimators were used in simulation to assess the characteristics of estimators. Meanwhile, MSE of distribution fitting, KS distance, and log-likelihood value were used to evaluate the GOF characteristics. Moreover, we demonstrated the performance of the algorithm by implementing it to women’s age at first marriage data in Indonesia. The results show that based on the bias and MSE properties, the PSO-KS point estimators yield similar characteristics with MLE, but better than MME. From the GOF perspective, PSO-KS outperforms in MSE of distribution fitting and KS distance, but not in log-likelihood value. We also observed these patterns in the women’s age at first marriage data. The contributions of this study are two-fold, first to assess the PSO-KS algorithm in the lognormal distribution case. Second, it implements the algorithm on women’s age at first marriage data, which has broad social, economic, and public health implications.
A New Biocryptosystem-Oriented Security Analysis Framework and Implementation of Multibiometric Cryptosystems Based on Decision Level Fusion
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2015
Identification of Bad Signatures in Batches
Publisher: Springer Berlin Heidelberg
Date: 2000
How to prevent cheating in Pinch's scheme
Publisher: Institution of Engineering and Technology (IET)
Date: 1997
DOI: 10.1049/EL:19970980
The eight variable homogeneous degree three bent functions
Publisher: Elsevier BV
Date: 02-2009
Spatial Encryption Revisited: From Delegatable Multiple Inner Product Encryption and More
Publisher: Springer International Publishing
Date: 2022
Rotational Cryptanalysis of Round-Reduced Keccak
Publisher: Springer Berlin Heidelberg
Date: 2014
Higher Order Universal One-Way Hash Functions from the Subset Sum Assumption
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11745853_11
Generalised cumulative arrays in secret sharing
Publisher: Springer Science and Business Media LLC
Date: 08-2006
High-rate and high-capacity measurement-device-independent quantum key distribution with Fibonacci matrix coding in free space
Publisher: Springer Science and Business Media LLC
Date: 07-05-2018
Fail-Stop Threshold Signature Schemes Based on Elliptic Curves
Publisher: Springer Berlin Heidelberg
Date: 1999
Socio-technological phishing prevention
Publisher: Elsevier BV
Date: 05-2011
On the Symmetric Property of Homogeneous Boolean Functions
Publisher: Springer Berlin Heidelberg
Date: 1999
The Compression Optimality of Asymmetric Numeral Systems
Publisher: MDPI AG
Date: 17-04-2023
DOI: 10.3390/E25040672
Abstract: Source coding has a rich and long history. However, a recent explosion of multimedia Internet applications (such as teleconferencing and video streaming, for instance) renews interest in fast compression that also squeezes out as much redundancy as possible. In 2009 Jarek Duda invented his asymmetric numeral system (ANS). Apart from having a beautiful mathematical structure, it is very efficient and offers compression with a very low coding redundancy. ANS works well for any symbol source statistics, and it has become a preferred compression algorithm in the IT industry. However, designing an ANS instance requires a random selection of its symbol spread function. Consequently, each ANS instance offers compression with a slightly different compression ratio. The paper investigates the compression optimality of ANS. It shows that ANS is optimal for any symbol sources whose probability distribution is described by natural powers of 1/2. We use Markov chains to calculate ANS state probabilities. This allows us to precisely determine the ANS compression rate. We present two algorithms for finding ANS instances with a high compression ratio. The first explores state probability approximations in order to choose ANS instances with better compression ratios. The second algorithm is a probabilistic one. It finds ANS instances whose compression ratios can be made as close to the best ratio as required. This is done at the expense of the number θ of internal random “coin” tosses. The algorithm complexity is O(θL3), where L is the number of ANS states. The complexity can be reduced to O(θLlog2L) if we use a fast matrix inversion. If the algorithm is implemented on a quantum computer, its complexity becomes O(θ(log2L)3).
Continuous authentication for VANET
Publisher: Elsevier BV
Date: 10-2020
Conference Key Agreement from Secret Sharing
Publisher: Springer Berlin Heidelberg
Date: 1999
Quantum-key-expansion protocol based on number-state-entanglement-preserving tensor network with compression
Publisher: American Physical Society (APS)
Date: 24-03-2022
NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model
Publisher: Springer Berlin Heidelberg
Date: 2012
Bucket attack on numeric set watermarking model and safeguards
Publisher: Elsevier BV
Date: 05-2011
Fast and simple high-capacity quantum cryptography with error detection
Publisher: Springer Science and Business Media LLC
Date: 13-04-2017
DOI: 10.1038/SREP46302
Abstract: Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.
Codes Identifying Bad Signatures in Batches
Publisher: Springer Berlin Heidelberg
Date: 2000
Modeling a multi-level secure object-oriented database using views
Publisher: Springer Berlin Heidelberg
Date: 1996
DOI: 10.1007/BFB0023299
Dynamic Searchable Symmetric Encryption with Forward and Stronger Backward Privacy
Publisher: Springer International Publishing
Date: 2019
Cryptanalysis of LASH
Publisher: Springer Berlin Heidelberg
Date: 2008
Software Watermarking Resilient to Debugging Attacks
Publisher: Academy Publisher
Date: 04-2007
Cryptography based on transcendental numbers
Publisher: Springer Berlin Heidelberg
Date: 1996
DOI: 10.1007/BFB0023291
Characterisations of Extended Resiliency and Extended Immunity of S-Boxes
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11734727_19
Preprocessing optimisation: revisiting recursive‐BKZ lattice reduction algorithm
Publisher: Institution of Engineering and Technology (IET)
Date: 11-2018
Crossword Puzzle Attack on NLS
Publisher: Springer Berlin Heidelberg
Date: 2007
On Public-Key Cryptosystems Built Using Polynomial Rings
Publisher: Springer Berlin Heidelberg
Date: 1986
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time
Publisher: Society for Industrial & Applied Mathematics (SIAM)
Date: 2010
DOI: 10.1137/080733802
Extending FORK-256 Attack to the Full Hash Function
Publisher: Springer Berlin Heidelberg
Date: 2007
Threshold MACs
Publisher: Springer Berlin Heidelberg
Date: 2003
On the Security of PAS (Predicate-Based Authentication Service)
Publisher: IEEE
Date: 12-2009
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Publisher: Springer Berlin Heidelberg
Date: 2004
On the Linearization of Human Identification Protocols: Attacks Based on Linear Algebra, Coding Theory, and Lattices
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2015
Critical analysis of spam prevention techniques
Publisher: IEEE
Date: 05-2011
Digital Immunity Module: Preventing Unwanted Encryption using Source Coding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-01-2022
DOI: 10.36227/TECHRXIV.17789735
Abstract: Unwanted data encryption, such as ransomware attacks, continues to be a significant cybersecurity threat. Ransomware is a preferred weapon of cybercriminals who target small to large organizations' computer systems and data centres. It is malicious software that infects a victim's computer system and encrypts all its valuable data files. The victim needs to pay a ransom, often in cryptocurrency, in return for a decryption key. Many solutions use methods, including the inspection of file signatures, runtime process behaviors, API calls, and network traffic, to detect ransomware code. However, unwanted data encryption is still a top threat. This paper presents the first immunity solution, called the digital immunity module (DIM). DIM focuses on protecting valuable business-related data files from unwanted encryption rather than detecting malicious codes or processes. We show that methods such as file entropy and fuzzy hashing can be effectively used to sense unwanted encryption on a protected file, triggering our novel source coding method to paralyze the malicious manipulation of data such as ransomware encryption. Specifically, maliciously encrypted data blocks consume exponentially larger space and longer writing time on the DIM-protected file system. As a result, DIM creates enough time for system/human intervention and forensics analysis. Unlike the existing solutions, DIM protects the data regardless of ransomware families and variants. Additionally, DIM can defend against simultaneously active multiple ransomware, including the most recent hard to detect and stop fileless ones. We tested our solution on 39 ransomware families, including the most recent ransomware attacks. DIM successfully defended our s le file dataset (1335 pdf, jpg, and tiff files) against those ransomware attacks with zero file loss.
Shared Generation of Pseudo-Random Functions with Cumulative Maps
Publisher: Springer Berlin Heidelberg
Date: 2003
A Combinatorial Approach to Anonymous Membership Broadcast
Publisher: Springer Berlin Heidelberg
Date: 2002
Parallel Authentication and Public-Key Encryption
Publisher: Springer Berlin Heidelberg
Date: 2003
Transformer-Based Language Models for Software Vulnerability Detection
Publisher: ACM
Date: 05-12-2022
Database Relation Watermarking Resilient against Secondary Watermarking Attacks
Publisher: Springer Berlin Heidelberg
Date: 2009
Moyamoya disease in a patient with schizophrenia
Publisher: Cambridge University Press (CUP)
Date: 07-2003
DOI: 10.1017/S1355617703950132
Abstract: We present the case of a 23-year-old Vietnamese male with a 2-year history of a psychotic illness marked by prominent negative symptoms, fatuousness and disturbed behavior. Neuroimaging revealed a prominent vascular flow void affecting the middle and anterior cerebral arteries, with associated increased collateral supply to the frontal cortex, consistent with Moyamoya disease. Neurological examination was unremarkable however, neuropsychological assessment revealed significant executive dysfunction, including stimulus-driven behavior. Whilst the diagnosis of schizophrenia and Moyamoya disease may be coincidental, an interaction between the 2 diseases may have led to some of the atypical features of this case, including prominent executive dysfunction and marked sensitivity to psychotropic medication. We discuss the nature of possible interactions between the 2 conditions. This case also highlights the importance of re-evaluating patients with atypical or treatment-resistant psychoses for cerebral pathology. ( JINS , 2003, 9 , 806–810.)
Provably secure three-party key agreement protocol using Chebyshev chaotic maps in the standard model
Publisher: Springer Science and Business Media LLC
Date: 11-04-2014
Related Organisations
University Medical Center Of The Johannes Gutenberg University Mainz
Location: Germany
Commonwealth Scientific And Industrial Research Organisation
Location: Australia
Related Funding Activities
ARC Research Network For A Secure Australia
Start Date: 2004
End Date: 2009
Funder: Australian Research Council
View Funded ActivityBuilding Trust In Australia's Infrastructure: Dealing With Scientific, Technological, Business, Policy And Legal Issues In Information Security
Start Date: 2003
End Date: 2003
Funder: Australian Research Council
View Funded ActivityWydajne I Bezpieczne Algorytmy Szyfrowania Z Uwierzytelnianiem - Nowe Rozwiązania I Zaawansowana Kryptoanaliza
Start Date: 2015
End Date: 2018
Funder: Fundacja na rzecz Nauki Polskiej
View Funded ActivityPrivacy-preserving Data Processing On The Cloud
Start Date: 2018
End Date: 2020
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0345366
Start Date: 2003
End Date: 12-2006
Amount: $225,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0987734
Start Date: 06-2009
End Date: 12-2014
Amount: $512,140.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP0776267
Start Date: 07-2007
End Date: 12-2012
Amount: $230,643.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP180102199
Start Date: 06-2018
End Date: 06-2024
Amount: $413,043.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP0453790
Start Date: 2004
End Date: 12-2006
Amount: $85,668.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP0349183
Start Date: 11-2003
End Date: 12-2008
Amount: $69,099.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0451484
Start Date: 2004
End Date: 03-2007
Amount: $210,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0663452
Start Date: 2006
End Date: 12-2009
Amount: $351,000.00
Funder: Australian Research Council
View Funded ActivitySpecial Research Initiatives - Grant ID: SR0354476
Start Date: 11-2003
End Date: 12-2004
Amount: $20,000.00
Funder: Australian Research Council
View Funded ActivitySpecial Research Initiatives - Grant ID: SR0354880
Start Date: 02-2004
End Date: 12-2004
Amount: $10,000.00
Funder: Australian Research Council
View Funded ActivityResearch Networks - Grant ID: RN0459557
Start Date: 12-2004
End Date: 12-2010
Amount: $1,950,000.00
Funder: Australian Research Council
View Funded Activity