696 results on '"Kurosawa, Kaoru"'
Search Results
2. On the Optimal Communication Complexity of Error-Correcting Multi-server PIR
3. Optimum Attack on 3-Round Feistel-2 Structure
4. A Note on the Invisibility and Anonymity of Undeniable Signature Schemes
5. On the Optimal Communication Complexity of Error-Correcting Multi-server PIR
6. How to Correct Errors in Multi-server PIR
7. How to Solve Multiple Short-Exponent Discrete Logarithm Problem
8. CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not -type) Assumptions
9. (Short Paper) How to Solve DLOG Problem with Auxiliary Input
10. How to Prove KDM Security of BHHO
11. Optimum Attack on 3-Round Feistel-2 Structure
12. A Note on the Invisibility and Anonymity of Undeniable Signature Schemes
13. An immunity against correlation attack on quantum stream cipher by Yuen 2000 protocol
14. Efficient No-dictionary Verifiable Searchable Symmetric Encryption
15. More Efficient Construction of Bounded KDM Secure Encryption
16. Primal-dual distance bounds of linear codes with application to cryptography
17. UC-Secure Dynamic Searchable Symmetric Encryption Scheme
18. How to Solve Multiple Short-Exponent Discrete Logarithm Problem
19. CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not $$\mathtt {q}$$ -type) Assumptions
20. (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
21. IBE Under -LIN with Shorter Ciphertexts and Private Keys
22. A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
23. Anonymous and leakage resilient IBE and IPE
24. Garbled Searchable Symmetric Encryption
25. Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited
26. 2-Pass Key Exchange Protocols from CPA-Secure KEM
27. How to Construct Strongly Secure Network Coding Scheme
28. (Short Paper) How to Solve DLOG Problem with Auxiliary Input
29. How to Prove KDM Security of BHHO
30. How to make a linear network code (strongly) secure
31. How to Factor N 1 and N 2 When
32. Leakage Resilient IBE and IPE under the DLIN Assumption
33. How to Update Documents Verifiably in Searchable Symmetric Encryption
34. UC-Secure Searchable Symmetric Encryption
35. Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions
36. Generic Fully Simulatable Adaptive Oblivious Transfer
37. Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
38. The Round Complexity of Perfectly Secure General VSS
39. A Generic Method for Reducing Ciphertext Length of Reproducible KEMs in the RO Model
40. Provably Secure Convertible Undeniable Signatures with Unambiguity
41. Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
42. Simple Adaptive Oblivious Transfer without Random Oracle
43. Almost Secure (1-Round, n-Channel) Message Transmission Scheme
44. New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
45. Universally Composable Undeniable Signature
46. Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
47. A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
48. Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
49. Small Secret Key Attack on a Variant of RSA (Due to Takagi)
50. Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.