Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Daniel Wichs

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 Sebastian Faust

> Home > Persons > Daniel Wichs

Publications

2016
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/FaustMVW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/FaustMVW16
Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits. IEEE Trans. Inf. Theory 62(12): 7179-7194 (2016)
2014
[c33]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/eurocrypt/FaustMVW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurocrypt/FaustMVW14
Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits. EUROCRYPT 2014: 111-128
2013
[i29]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/FaustMVW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/FaustMVW13
Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits. IACR Cryptol. ePrint Arch. 2013: 702 (2013)

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.