◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Christian Schaffner

41 papers hereh-index 314.2k citations75 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1
  • middle author19
  • last author20

Across the 41 of 41 papers where every author was matched, so the position is known.

fields
  • quant-ph35
  • cs.CR4
  • cs.GL1
  • q-bio.PE1
same name
  • Christian Schaffner — 4 papers, h 2
  • Christian Schaffner — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20052022
most citedThe operational meaning of min- and max-entropy

668 citations · 2.6k across the 41 of their papers we have counts for

collaborators
Showing 2010 · quant-phShow all

4 papers · 2 filters

quant-ph2010★ 85 cited

Position-Based Quantum Cryptography: Impossibility and Constructions

Harry Buhrman, Nishanth Chandran, Serge Fehr +4

In this work, we study position-based cryptography in the quantum setting. The aim is to use the geographical position of a party as its only credential. On the negative side, we s…

quant-ph2010★ 450 cited

Random Oracles in a Quantum World

Dan Boneh, Özgür Dagdelen, Marc Fischlin +3

The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems. Som…

quant-ph2010★ 42 cited

Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model

Christian Schaffner

We present simple protocols for oblivious transfer and password-based identification which are secure against general attacks in the noisy-quantum-storage model as defined in [KWW0…

quant-ph2010★ 313 cited

Leftover Hashing Against Quantum Side Information

Marco Tomamichel, Christian Schaffner, Adam Smith +1

The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formu…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.