Towards a Theory of Data Entanglement ⋆ (Extended Abstract) (2008)
James Aspnes, Joan Feigenbaum, R Yampolskiy, Sheng Zhong
Abstract. We give a formal model for systems that store data in entangled form. We propose a new notion of entanglement, called all-ornothing integrity (AONI) that binds the users ’ data in a way...
Towards a Theory of Data Entanglement ⋆,⋆⋆ Abstract (2008)
James Aspnes, Joan Feigenbaum, R Yampolskiy, Sheng Zhong
We give a formal model for systems that store data in entangled form. We propose a new notion of entanglement, called all-or-nothing integrity (AONI) that binds the users ’ data in a way that makes...
Yevgeniy Dodis, R Yampolskiy, Moti Yung
Abstract. We construct a reasonably efficient threshold and proactive pseudo-random permutation (PRP). Our protocol needs only O(1) communication rounds. It tolerates up to (n − 1)/2 of n dishonest...
Yevgeniy Dodis, R Yampolskiy, Moti Yung
Abstract. We construct a reasonably efficient threshold and proactive pseudo-random permutation (PRP). Our protocol needs only O(1) communication rounds. It tolerates up to (n − 1)/2 of n dishonest...
Yevgeniy Dodis, R Yampolskiy, Moti Yung
Abstract. We construct a reasonably efficient threshold and proactive pseudo-random permutation (PRP). Our protocol needs only O(1) communication rounds. It tolerates up to (n − 1)/2 of n dishonest...
Spreading alerts quietly and the subgroup escape problem (2005)
James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy, James Aspnes, ...
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has not been known how...
Spreading alerts quietly and the subgroup escape problem (2005)
Abstract. We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has not been...
A verifiable random function with short proofs and keys (2005)
Abstract. We give a simple and efficient construction of a verifiable random function (VRF) on groups equipped with a bilinear mapping. Our construction is direct; it bypasses an expensive...
Spreading alerts quietly and the subgroup escape problem (2005)
James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, R Yampolskiy
Abstract. We introduce a new cryptographic primitive called a blind coupon mecha-nism (BCM). In effect, a BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has not been...
Inoculation Strategies for Victims of Viruses and the Sum-of-Squares Partition Problem (2005)
Kevin Chang, Aleksandr Yampolskiy, James Aspnes, James Aspnes, Kevin Chang Aleks, R Yampolskiy
We propose a simple game for modeling containment of the spread of viruses in a graph of n nodes. Each node must choose to either install anti-virus software at some known cost C, or risk infection...
Towards a Theory of Data Entanglement (2004)
Exte Nd Ed, James Aspnes, Joan Feigenbaum, R Yampolskiy, Sheng Zhong
We give a formal model for systems that store data in entangled form. We propose a new notion of entanglement, called all-or-nothing integrity (AONI) that binds the users' data in a way that...
and the Sum-of-Squares Partition Problem (2004)
James Aspnes, Kevin Chang, Aleksandr Yampolskiy, James Aspnes, Kevin Chang Aleks, R Yampolskiy
Abstract We propose a simple game for modeling containment of the spread of viruses in a graph of nnodes. Each node must choose to either install anti-virus software at some known cost C, or...