Share This Author
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- R. Cramer, Y. Dodis, S. Fehr, C. Padró, Daniel Wichs
- Computer Science, MathematicsEUROCRYPT
- 13 April 2008
This work introduces a new primitive called an algebraic manipulation detection code, which encodes a source s into a value x stored on Σ(G) so that any tampering by an adversary will be detected, and gives a nearly optimal construction of AMD codes, which can flexibly accommodate arbitrary choices for the length of the source s and security level.
On quantum Rényi entropies: A new generalization and some properties
This work proposes a new quantum generalization of the family of Renyi entropies that contains the von Neumann entropy, min-entropy, collision entropy, and the max-entropies as special cases, thus encompassing most quantum entropie in use today.
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
This work proposes a slightly weaker notion of security, saying that no partial information about encrypted messages should be leaked as long as each message is a-priori hard-to-guess given the others, and shows equivalence of this definition to single-message and indistinguishability-based ones, which are easier to work with.
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
This contribution devise a new solution to the selective opening problem that does not build on lossy encryption and combines techniques from non-committing encryption and hash proof systems with a new technique to glue several ciphertext parts together, resulting in a rather practical SO-CCA secure public-key encryption scheme thatdoes not suffer from the efficiency drawbacks of known schemes.
On quantum Renyi entropies: a new definition and some properties
This paper presents a probabilistic simulation of the response of the proton-proton collision in a discrete-time setting with real-time consequences.
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
Using certain low degree integral extensions of Z over which there exist pairs of sufficiently large Vandermonde matrices with co-prime determinants, a black-box secret sharing scheme with expansion factor O(log n) is constructed, which it is shown is minimal.
Quantum Authentication and Encryption with Key Recycling
We propose an information-theoretically secure encryption scheme for classical messages with quantum ciphertexts that offers detection of eavesdropping attacks, and re-usability of the key in case no…
On the Conditional Rényi Entropy
This paper reconsiders the definition for the conditional Rényi entropy of general order as proposed by Arimoto in the seventies, and shows that this particular notion satisfies several natural properties, including monotonicity under conditioning and chain rule.
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
A new n-player MPC protocol is presented that is secure against a computationally-unbounded malicious adversary that can adaptively corrupt t < n/2 of the players, and several novel techniques are introduced that will have wider applicability.
Position-Based Quantum Cryptography: Impossibility and Constructions
- H. Buhrman, Nishanth Chandran, Christian Schaffner
- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 14 August 2011
It is proved that with the help of sufficient pre-shared entanglement, any non-local quantum computation, i.e., any computation that involves quantum inputs from two parties at different locations, can be performed instantaneously and without any communication, up to local corrections that need to be applied to the outputs.