40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)最新文献_第4页

Non-interactive cryptocomputing for NC/sup 1/ NC/sup的非交互式密码计算

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814630

T. Sander, A. Young, M. Yung

{"title":"Non-interactive cryptocomputing for NC/sup 1/","authors":"T. Sander, A. Young, M. Yung","doi":"10.1109/SFFCS.1999.814630","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814630","url":null,"abstract":"The area of \"computing with encrypted data\" has been studied by numerous authors in the past twenty years since it is fundamental to understanding properties of encryption and it has many practical applications. The related fundamental area of \"secure function evaluation\" has been studied since the mid 80's. In its basic two-party case, two parties (Alice and Bob) evaluate a known circuit over private inputs (or a private input and a private circuit). Much attention has been paid to the important issue of minimizing rounds of computation in this model. Namely, the number of communication rounds in which Alice and Bob need to engage in to evaluate a circuit on encrypted data securely. Advancements in these areas have been recognized as open problems and have remained open for a number of years. In this paper we give a one round, and thus round optimal, protocol for secure evaluation of circuits which is in polynomial time for NC/sup 1/ circuits. The protocol involves an input party sending encrypted input to a second party, a cryptocomputer, which evaluates the circuit (or a known circuit over its additional private input) non-interactively, securely and obliviously, and provides the output to the input party without learning it. This improves on previous (general) results that are specialized to the case of NC/sup 1/ circuits and require a constant number of communication rounds. We further suggest applications to network and mobile computing.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132968250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 246

PSPACE has constant-round quantum interactive proof systems PSPACE拥有恒圆量子交互证明系统

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814583

John Watrous

引用次数: 124

Near-optimal conversion of hardness into pseudo-randomness 近乎最优的硬度到伪随机性的转换

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814590

R. Impagliazzo, Ronen Shaltiel, A. Wigderson

{"title":"Near-optimal conversion of hardness into pseudo-randomness","authors":"R. Impagliazzo, Ronen Shaltiel, A. Wigderson","doi":"10.1109/SFFCS.1999.814590","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814590","url":null,"abstract":"Various efforts have been made to derandomize probabilistic algorithms using the assumption that there exists a problem in E=dtime(2/sup O(n)/) that requires circuits of size s(n) (for some function s). These results are based on the NW (Nisan & Wigderson, 1997) generator. For the strong lower bound s(n)=2/sup /spl epsi/n/, the optimal derandomization is P=BPP. However, for weaker lower bound functions s(n), these constructions fall short of the natural conjecture for optimal derandomization that bptime(t)/spl sube/ dtime(2¿O[s/sup -1/(t)]). The gap is due to an inherent efficiency limitation in NW-style pseudorandom generators. We are able to obtain derandomization in almost optimal time using any lower bound s(n). We do this by using the NW-generator in a more sophisticated way. We view any failure of the generator as a reduction from the given hard function to its restrictions on smaller input sizes. Thus, either the original construction works optimally or one of the restricted functions is as hard as the original. Any such restriction can then be plugged into the NW-generator recursively. This process generates many candidate generators, and at least one is guaranteed to be good. To perform the approximation of the acceptance probability of the given circuit, we run a tournament between the candidate generators which yields an accurate estimate. We explore information theoretic analogs of our new construction. The inherent limitation of the NW-generator makes the extra randomness required by that extractor suboptimal. However, applying our construction, we get an almost optimal disperser.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126794992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 50

Stochastic load balancing and related problems 随机负载均衡及相关问题

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814632

Ashish Goel, P. Indyk

引用次数: 179

Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs 有向图中维持全对最短路径和传递闭包的全动态算法

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814580

Valerie King

引用次数: 255

A theoretical framework for memory-adaptive algorithms 记忆自适应算法的理论框架

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814599

Rakesh D. Barve, J. Vitter

{"title":"A theoretical framework for memory-adaptive algorithms","authors":"Rakesh D. Barve, J. Vitter","doi":"10.1109/SFFCS.1999.814599","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814599","url":null,"abstract":"External memory algorithms play a key role in database management systems and large scale processing systems. External memory algorithms are typically tuned for efficient performance given a fixed, statically allocated amount of internal memory. However, with the advent of real-time database system and database systems based upon administratively defined goals, algorithms must increasingly be able to adapt in an online manner when the amount of internal memory allocated to them changes dynamically and unpredictably. We present a theoretical and applicable framework for memory-adaptive algorithms (or simply MA algorithms). We define the competitive worst-case notion of what it means for an MA algorithm to be dynamically optimal and prove fundamental lower bounds on the performance of MA algorithms for problems such as sorting, standard matrix multiplication, and several related problems. Our main tool for proving dynamic optimality is the notion of resource consumption, which measures how efficiently an MA algorithm adapts itself to memory fluctuations. We present the first dynamically optimal algorithm for sorting (based upon mergesort), permuting, FFT, permutation networks, buffer trees, (standard) matrix multiplication, and LU decomposition. In each case, dynamic optimality is demonstrated via a potential function argument showing that the algorithm's resource consumption is within a constant factor of optimal.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134018118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 20

Markovian coupling vs. conductance for the Jerrum-Sinclair chain Jerrum-Sinclair链的马尔可夫耦合与电导

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814596

V. S. A. Kumar, R. Hariharan

引用次数: 27

Regular languages are testable with a constant number of queries 常规语言可以用固定数量的查询进行测试

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814641

N. Alon, M. Krivelevich, I. Newman, M. Szegedy

引用次数: 161

Primal-dual approximation algorithms for metric facility location and k-median problems 度量设施定位和k-中值问题的原对偶逼近算法

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814571

K. Jain, V. Vazirani

引用次数: 283

Lovasz's lemma for the three-dimensional K-level of concave surfaces and its applications 凹曲面三维k级的Lovasz引理及其应用

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814610

N. Katoh, T. Tokuyama

引用次数: 10