STOC '05
Author : ACM Special Interest Group for Algorithms and Computation Theory
Publisher :
Page : 798 pages
File Size : 11,80 MB
Release : 2005
Category : Computational complexity
ISBN : 9781581139600
Author : ACM Special Interest Group for Algorithms and Computation Theory
Publisher :
Page : 798 pages
File Size : 11,80 MB
Release : 2005
Category : Computational complexity
ISBN : 9781581139600
Author :
Publisher :
Page : 828 pages
File Size : 38,34 MB
Release : 1993
Category : Computation theory
ISBN :
Author :
Publisher :
Page : 368 pages
File Size : 27,14 MB
Release : 1993
Category : Library science
ISBN :
Author : Martin Hirt
Publisher : Springer
Page : 698 pages
File Size : 33,10 MB
Release : 2016-10-21
Category : Computers
ISBN : 3662536412
The two-volume set LNCS 9985 and LNCS 9986 constitutes the refereed proceedings of the 14th International Conference on Theory of Cryptography, TCC 2016-B, held in Beijing, China, in November 2016. The total of 45 revised full papers presented in the proceedings were carefully reviewed and selected from 113 submissions. The papers were organized in topical sections named: TCC test-of-time award; foundations; unconditional security; foundations of multi-party protocols; round complexity and efficiency of multi-party computation; differential privacy; delegation and IP; public-key encryption; obfuscation and multilinear maps; attribute-based encryption; functional encryption; secret sharing; new models.
Author :
Publisher :
Page : 388 pages
File Size : 35,87 MB
Release : 2003
Category : Computer science
ISBN :
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of parties. Given two numbers x and e, the protocol computes y such that ye=x (mod N). A synchronous protocol for this task has been presented by Catalano, Gennaro, and Halevi (Eurocrypt 2000), but the standard approach for turning this into an asynchronous protocol would require a Byzantine-agreement sub-protocol. Our protocol adopts their approach, but exploits a feature of the problem in order to avoid the use of a Byzantine agreement primitive. Hence, it leads to efficient asynchronous protocols for threshold signatures and for Byzantine agreement based on the strong RSA assumption, without the use of random oracles.
Author : Christopher Matthew Umans
Publisher :
Page : 228 pages
File Size : 28,60 MB
Release : 2000
Category :
ISBN :
Author :
Publisher :
Page : 628 pages
File Size : 43,75 MB
Release : 1993
Category : Information technology
ISBN :
Author : Prasad Jayanti
Publisher : Springer
Page : 375 pages
File Size : 46,56 MB
Release : 2003-07-31
Category : Computers
ISBN : 3540481699
DISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. This volume includes 23 contributed papers and an invited lecture, all presented at DISC ’99, held on September 27-29, 1999 in Bratislava, Slovak Republic. In addition to regular submissions, the call for papers for DISC ’99 also - licited Brief Announcements (BAs). We received 60 regular submissions and 15 brief announcement submissions. These were read and evaluated by the p- gramcommittee, with the additional help of external reviewerswhen needed. At the program committee meeting on June 10-11 at Dartmouth College, Hanover, USA, 23 regular submissions and 4 BAs were selected for presentation at DISC ’99. The extended abstracts of these 23 regular papers appear in this volume, while the four BAs appear as a special publication of Comenius Univ- sity, Bratislava– the hostof DISC ’99.It is expected that the regularpapers will be submitted later, in more polished form, to fully refereed scienti?c journals. Of the 23 regular papers selected for the conference, 12 quali?ed for the Best Student Paper award. The program committee awarded this honor to the paper entitled “Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast” by Marcos Aguilera, Sam Toueg, and Borislav Deianov. Marcos and Borislav, who are both students, share this award.
Author : Ulrik Brandes
Publisher : Springer Science & Business Media
Page : 481 pages
File Size : 28,1 MB
Release : 2005-02-09
Category : Computers
ISBN : 3540249796
‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models. From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks. In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.
Author : Alexander A. Shvartsman
Publisher : Springer Science & Business Media
Page : 452 pages
File Size : 44,92 MB
Release : 2006-11-27
Category : Computers
ISBN : 3540499903
This book constitutes the refereed proceedings of the 10th International Conference on Principles of Distributed Systems, OPODIS 2006, held at Bordeaux, France, in December 2006. The 28 revised full papers presented together with 2 invited talks were carefully reviewed and selected from more than 230 submissions. The papers address all current issues in theory, specification, design and implementation of distributed and embedded systems.