Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Qiang Tang 0005

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nikos Leonardos

> Home > Persons > Qiang Tang 0005

Publications

2015
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/popets/KiayiasLLPT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/popets/KiayiasLLPT15
Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang:
Optimal Rate Private Information Retrieval from Homomorphic Encryption. Proc. Priv. Enhancing Technol. 2015(2): 222-243 (2015)
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/ctrsa/KiayiasLLPT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ctrsa/KiayiasLLPT15
Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang:
Communication Optimal Tardos-Based Asymmetric Fingerprinting. CT-RSA 2015: 469-486
2014
[i4]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/KiayiasLLPT14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/KiayiasLLPT14
Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang:
Near Optimal Rate Homomorphic Encryption for Branching Programs. IACR Cryptol. ePrint Arch. 2014: 851 (2014)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.