activity
20102018
most citedSecure two-party quantum evaluation of unitaries against specious adversaries

41 citations · 71 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DS2018

Lower Bounds for Oblivious Data Structures

Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen

An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced b…

cs.CR2012★ 28 cited

A New Approach to Practical Active-Secure Two-Party Computation

Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi +1

We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-ba…

quant-ph2011★ 2 cited

Superposition Attacks on Cryptographic Protocols

Ivan Damgaard, Jakob Funder, Jesper Buus Nielsen +1

Attacks on classical cryptographic protocols are usually modeled by allowing an adversary to ask queries from an oracle. Security is then defined by requiring that as long as the q…

quant-ph2011

Fully Simulatable Quantum-Secure Coin-Flipping and Applications

Carolin Lunemann, Jesper Buus Nielsen

We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented w…

quant-ph2010★ 41 cited

Secure two-party quantum evaluation of unitaries against specious adversaries

Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail

We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum…