The following pages link to Koji Nuida (Q420722):
Displaying 50 items.
- Locally parabolic subgroups in Coxeter groups of arbitrary ranks. (Q420723) (← links)
- (Q478813) (redirect page) (← links)
- On affine maps on non-compact convex sets and some characterizations of finite-dimensional solid ellipsoids (Q478814) (← links)
- Distinguishability measures and entropies for general probabilistic theories (Q540802) (← links)
- An improvement of discrete Tardos fingerprinting codes (Q735039) (← links)
- Intrinsic reflections in Coxeter systems (Q739395) (← links)
- Improved supersingularity testing of elliptic curves using Legendre form (Q831974) (← links)
- A characterization of signed graphs with generalized perfect elimination orderings (Q965961) (← links)
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems (Q1650427) (← links)
- Secure grouping protocol using a deck of cards (Q1705722) (← links)
- An efficient private evaluation of a decision graph (Q1736045) (← links)
- A public-key encryption scheme based on non-linear indeterminate equations (Q1746969) (← links)
- On limitations and alternatives of privacy-preserving cryptographic protocols for genomic data (Q1800593) (← links)
- Secure multi-party computation using polarizing cards (Q1800599) (← links)
- On finite factors of centralizers of parabolic subgroups in Coxeter groups. (Q1936049) (← links)
- Efficiency and accuracy improvements of secure floating-point addition over secret sharing (Q1995505) (← links)
- Polynomial expressions of \(p\)-ary auction functions (Q2003342) (← links)
- Cryptographic pseudorandom generators can make cryptosystems problematic (Q2061967) (← links)
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions (Q2128566) (← links)
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation (Q2145393) (← links)
- Constant-round client-aided secure comparison protocol (Q2167759) (← links)
- Locally finite continuations and Coxeter groups of infinite ranks (Q2196324) (← links)
- A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477) (← links)
- Communication-efficient (client-aided) secure two-party protocols and its application (Q2226598) (← links)
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks (Q2229283) (← links)
- Short lattice signatures in the standard model with efficient tag generation (Q2692311) (← links)
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures (Q2701489) (← links)
- A Simple and Improved Algorithm for Integer Factorization with Implicit Hints (Q2790046) (← links)
- On the Isomorphism Problem for Coxeter Groups and Related Topics (Q2807173) (← links)
- On centralizers of parabolic subgroups in Coxeter groups. (Q2882817) (← links)
- Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues (Q2922681) (← links)
- How to Use Pseudorandom Generators in Unconditional Security Settings (Q2948157) (← links)
- (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces (Q2948343) (← links)
- Size-Hiding Computation for Multiple Parties (Q2953801) (← links)
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes (Q2989492) (← links)
- A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators (Q3098001) (← links)
- (Q3176551) (← links)
- (Q3176610) (← links)
- Almost central involutions in split extensions of Coxeter groups by graph automorphisms (Q3429457) (← links)
- Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards (Q3467159) (← links)
- Pattern Occurrence in the Dyadic Expansion of Square Root of Two and an Analysis of Pseudorandom Number Generators (Q3560001) (← links)
- Intrinsic reflections and strongly rigid Coxeter groups (Q4634480) (← links)
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes (Q4931668) (← links)
- A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure (Q4931678) (← links)
- An Improvement of Pseudorandomization against Unbounded Attack Algorithms – The Case of Fingerprint Codes (Q4931679) (← links)
- Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory (Q4964355) (← links)
- An elementary linear-algebraic proof without computer-aided arguments for the group law on elliptic curves (Q5042554) (← links)
- An improvement of a key exchange protocol relying on polynomial maps (Q5042559) (← links)
- Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security (Q5095928) (← links)
- Optimal observables for minimum-error state discrimination in general probabilistic theories (Q5245809) (← links)
