PaperMetrixEvidence-aware discovery
EN
Interface language English EN العربية AR Türkçe TR
Create account
Researcher profile

Takashi Yamakawa

6 papers in the PaperMetrix corpus

Publications

Papers by this author

  1. Efficient key encapsulation mechanisms with tight security reductions to standard assumptions in the two security models

    2016 · Security and Communication Networks

    Abstract In this paper, we propose two new practical constructions of chosen ciphertext attack secure (CCA secure) key encapsulation mechanisms (KEM, which is the main building block for public key encryption in hybrid encryption), with …

  2. Designated Verifier/Prover and Preprocessing NIZKs from Diffie-Hellman Assumptions.

    2019 · IACR Cryptology ePrint Archive

    In a non-interactive zero-knowledge (NIZK) proof, a prover can non-interactively convince a verifier of a statement without revealing any additional information. Thus far, numerous constructions of NIZKs have been provided in the common reference string …

  3. Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication

    2021 · arXiv (Cornell University)

    Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive called quantum encryption with certified deletion. In this primitive, a receiver in possession of a quantum ciphertext can generate a classical certificate that the encrypted …

  4. Classically Verifiable NIZK for QMA with Preprocessing

    2021 · arXiv (Cornell University)

    We propose three constructions of classically verifiable non-interactive zero-knowledge proofs and arguments (CV-NIZK) for QMA in various preprocessing models. - We construct a CV-NIZK for QMA in the quantum secret parameter model where a trusted …

  5. Certified Everlasting Functional Encryption

    2022 · arXiv (Cornell University)

    Computational security in cryptography has a risk that computational assumptions underlying the security are broken in the future. One solution is to construct information-theoretically-secure protocols, but many cryptographic primitives are known to be impossible (or …

  6. Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More

    2023 · arXiv (Cornell University)

    We study certified everlasting secure functional encryption (FE) and many other cryptographic primitives in this work. Certified everlasting security roughly means the following. A receiver possessing a quantum cryptographic object can issue a certificate showing …