Search
Search Results
-
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...
-
Compact Structure-Preserving Signatures with Almost Tight Security
In structure-preserving cryptography, every building block shares the same bilinear groups. These groups must be generated for a specific, a priori...
-
Key Exchange with Tight (Full) Forward Secrecy via Key Confirmation
Weak forward secrecy (wFS) of authenticated key exchange (AKE) protocols is a passive variant of (full) forward secrecy (FS). A natural mechanism to...
-
EKE Meets Tight Security in the Universally Composable Framework
(Asymmetric) Password-based Authenticated Key Exchange ((a)PAKE) protocols allow two parties establish a session key with a pre-shared low-entropy...
-
Signatures with Memory-Tight Security in the Quantum Random Oracle Model
Memory tightness of reductions in cryptography, in addition to the standard tightness related to advantage and running time, is important when the...
-
Efficient and Tight Oblivious Transfer from PKE with Tight Multi-user Security
We propose an efficient oblivious transfer in the random oracle model based on public key encryption with pseudorandom public keys. The construction...
-
Loose–tight cluster regularization for unsupervised person re-identification
Unsupervised person re-identification (Re-ID) is a critical and challenging task in computer vision. It aims to identify the same person across...
-
Signed (Group) Diffie–Hellman Key Exchange with Tight Security
We propose the first tight security proof for the ordinary two-message signed Diffie–Hellman key exchange protocol in the random oracle model. Our...
-
Lattice-Based Authenticated Key Exchange with Tight Security
We construct the first tightly secure authenticated key exchange (AKE) protocol from lattices. Known tight constructions are all based on...
-
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
We prove a new property of dual hypergraphs and derive from it Nash-solvability of the corresponding (tight) game forms. This result is known since...
-
Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication
Broadcast Encryption (BE) is public-key encryption allowing a sender to encrypt a message by specifing recipients, and only the specified recipients...
-
Hiding in Plain Sight: Memory-Tight Proofs via Randomness Programming
This paper continues the study of memory-tight reductions (Auerbach et al., CRYPTO ’17). These are reductions that only incur minimal memory costs...
-
Almost Tight Multi-user Security Under Adaptive Corruptions & Leakages in the Standard Model
In this paper, we consider tight multi-user security under adaptive corruptions, where the adversary can adaptively corrupt some users and obtain...
-
Almost Tight Multi-user Security Under Adaptive Corruptions from LWE in the Standard Model
In this work, we construct the first digital signature (SIG) and public-key encryption (PKE) schemes with almost tight multi-user security under...
-
Recovering the Tight Security Proof of SPHINCS \(^+\)
In 2020, Kudinov, Kiktenko, and Fedorov pointed out a flaw in the tight security proof of the SPHINCS...
-
Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
We construct an identity-based encryption (IBE) scheme that is tightly secure in a very strong sense. Specifically, we consider a setting with many...
-
Lotus: a memory organization for loose and tight coupling neurons in neuromorphic architecture
Due to the bionic features, neuromorphic computing has achieved higher energy efficiency than deep learning in many fields in recent years. Similar...
-
Essentially Tight Kernels for (Weakly) Closed Graphs
We study kernelization of classic hard graph problems when the input graphs fulfill triadic closure properties. More precisely, we consider the...
-
Unifying Freedom and Separation for Tight Probing-Secure Composition
The masking countermeasure is often analyzed in the probing model. Proving the probing security of large circuits at high masking orders is achieved...
-
Tight Approximation Algorithms for Ordered Covering
The classical unweighted set cover problem aims to pick a minimum number of subsets from a given family of subsets whose union would cover the...