Search
Search Results
-
Power of Randomness Recovery: Tighter CCA-Secure KEM in the QROM
We propose a novel, efficient and secure Key Encapsulation Mechanism (KEM) transformation in the random oracle model. Furthermore, we demonstrate its...
-
Tighter Construction of Tight Büchi Automata
Tight automata are useful in providing the shortest counterexample in LTL model checking and also in constructing a maximally satisfying strategy in...
-
Tighter Security for Generic Authenticated Key Exchange in the QROM
We give a tighter security proof for authenticated key exchange (AKE) protocols that are generically constructed from key encapsulation mechanisms...
-
Ring-Based Identity Based Encryption – Asymptotically Shorter MPK and Tighter Security
This work constructs an identity based encryption from the ring learning with errors assumption (RLWE), with shorter master public keys and tighter...
-
Tighter QCCA-Secure Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model
Hofheinz et al. (TCC 2017) proposed several key encapsulation mechanism (KEM) variants of Fujisaki-Okamoto (FO) transformation, including...
-
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model
In (STOC, 2008), Gentry, Peikert, and Vaikuntanathan proposed the first identity-based encryption (GPV-IBE) scheme based on a post-quantum...
-
A Simpler and More Efficient Reduction of DLog to CDH for Abelian Group Actions
Abelian group actions appear in several areas of cryptography, especially isogeny-based post-quantum cryptography. A natural problem is to relate the...
-
Tighter Proofs for the SIGMA and TLS 1.3 Key Exchange Protocols
We give new, fully-quantitative and concrete bounds that justify the SIGMA and TLS 1.3 key exchange protocols not just in principle, but in practice....
-
Heterogeneous sets in dimensionality reduction and ensemble learning
We present a general framework for dealing with set heterogeneity in data and learning problems, which is able to exploit low complexity components....
-
QCCA-Secure Generic Key Encapsulation Mechanism with Tighter Security in the Quantum Random Oracle Model
Xagawa and Yamakawa (PQCrypto 2019) proved the transformation $$\mathsf...
-
Recent Advances in Practical Data Reduction
Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of...
-
Partial-order reduction in reachability-based response-time analyses of limited-preemptive DAG tasks
Response-time analysis (RTA) has been a means to evaluate the temporal correctness of real-time systems since the 1970 s. While early analyses were...
-
Ebola optimization search algorithm for the enhancement of devops and cycle time reduction
One of the main complications with Team Foundation Server (TFS) is that it was developed even before user experience was made a top priority. The...
-
An Algorithm for the Formal Reduction of Differential Equations as Over-Approximations
Models of complex systems often consist of state variables with structurally similar dynamics that differ in the specific values of some parameters....
-
Maintaining Trust in Reduction: Preserving the Accuracy of Quantities of Interest for Lossy Compression
As the growth of data sizes continues to outpace computational resources, there is a pressing need for data reduction techniques that can...
-
Accelerating local SGD for non-IID data using variance reduction
Distributed stochastic gradient descent and its variants have been widely adopted in the training of machine learning models, which apply multiple...
-
Efficient mining high average-utility itemsets with effective pruning strategies and novel list structure
High utility itemset mining can mine all itemsets that meet the minimum utility threshold set by the decision maker, thus becomes a popular and...
-
A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm
Modeling high-level synthesis (HLS) as mixed integer linear programming (MILP) affords the opportunity to integrate constraints and optimization...
-
Variance reduction for additive functionals of Markov chains via martingale representations
In this paper, we propose an efficient variance reduction approach for additive functionals of Markov chains relying on a novel discrete-time...
-
Probabilistic Hash-and-Sign with Retry in the Quantum Random Oracle Model
A hash-and-sign signature based on a preimage-sampleable function (Gentry et al., STOC 2008) is secure in the quantum random oracle model if the...