Sciweavers

1100 search results - page 106 / 220
» Approximate distance oracles
Sort
View
ALT
2006
Springer
15 years 7 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
ICPP
2009
IEEE
15 years 4 months ago
Exploring the Cost-Availability Tradeoff in P2P Storage Systems
—P2P storage systems use replication to provide a certain level of availability. While the system must generate new replicas to replace replicas lost to permanent failures, it ca...
Zhi Yang, Yafei Dai, Zhen Xiao
ASIACRYPT
2009
Springer
15 years 4 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 2 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
ASIACRYPT
2004
Springer
15 years 1 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini