The following pages link to Takeshi Koshiba (Q434347):
Displaying 40 items.
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption (Q742024) (← links)
- Learning deterministic even linear languages from positive examples (Q1390943) (← links)
- New assumptions on isogenous pairing groups with applications to attribute-based encryption (Q1736028) (← links)
- A guests managing system with lattice-based verifier-local revocation group signature scheme with time-bound keys (Q2050671) (← links)
- Quantum verifiable protocol for secure modulo zero-sum randomness (Q2101598) (← links)
- Achieving full security for lattice-based group signatures with verifier-local revocation (Q2218957) (← links)
- Low-density attack revisited (Q2384011) (← links)
- Universal test for quantum one-way permutations (Q2575756) (← links)
- Arbitrable blind quantum computation (Q2677521) (← links)
- Inferring pure context-free languages from positive data (Q2714262) (← links)
- (Q2724584) (← links)
- Strong encryption of public key cryptosystems based on weak randomness hypotheses (Q2743805) (← links)
- Practical Packing Method in Somewhat Homomorphic Encryption (Q2949580) (← links)
- (Q3043925) (← links)
- (Q3046340) (← links)
- Public Discussion Must Be Back and Forth in Secure Message Transmission (Q3095000) (← links)
- Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics (Q3191230) (← links)
- Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption (Q3194623) (← links)
- Perfectly Secure Message Transmission Against Independent Rational Adversaries (Q3297684) (← links)
- (Q3437586) (← links)
- A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions (Q3604596) (← links)
- Strengthening the Security of Distributed Oblivious Transfer (Q3634507) (← links)
- Reducing Complexity Assumptions for Oblivious Transfer (Q3638987) (← links)
- (Q4353917) (← links)
- (Q4373609) (← links)
- (Q4450741) (← links)
- (Q4452563) (← links)
- (Q4474095) (← links)
- (Q4505375) (← links)
- Private Conjunctive Query over Encrypted Data (Q4975185) (← links)
- Guesswork of a Quantum Ensemble (Q5088453) (← links)
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption (Q5170785) (← links)
- Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function (Q5189225) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311155) (← links)
- Computational Indistinguishability Between Quantum States and Its Cryptographic Application (Q5385734) (← links)
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification (Q5502802) (← links)
- Public Key Cryptography – PKC 2004 (Q5901802) (← links)
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation (Q6108614) (← links)
