NDLI: Fast and unconditionally secure anonymous channel

Please wait, while we are loading the content...

Rational and resilient protocols

Signature-free asynchronous byzantine consensus with t < n/3 and $o(n^{2})$ messages

The future(s) of shared data structures

Multi-message broadcast with abstract MAC layers and unreliable links

Anonymous networks: randomization = 2-hop coloring

Estimation for monotone sampling: competitiveness and customization

Coding theory for scalable media delivery

Distributed connectivity decomposition

Complexity tradeoffs for read and update operations

Software-improved hardware lock elision

Trade-offs between selection complexity and performance when searching the plane without communication

An incomplete history of concurrency chapter 1. 1965--1977

Rigorous system design

How to withstand mobile virus attacks, revisited

Efficient lock-free binary search trees

Beyond geometry: towards fully realistic wireless models

Making objects writable

Asynchronous MPC with a strict honest majority using non-equivocation

A paradox of eventual linearizability in shared memory

Consensus with an abstract MAC layer

Beyond set disjointness: the communication complexity of finding the intersection

Distributed algorithms for the Lovász local lemma and graph coloring

Can quantum communication speed up distributed computation?

Concurrent updates with RCU: search tree as an example

A generalized asynchronous computability theorem

Improved distributed steiner forest construction

Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares

The amortized complexity of non-blocking binary search trees

On the impact of geometry on ad hoc communication in wireless networks

Asynchronous convex hull consensus in the presence of crash faults

Distributing the setup in universally composable multi-party computation

Brief announcement: are lock-free concurrent algorithms practically wait-free?

Simple and efficient local codes for distributed stable network construction

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication

Brief announcement: towards security and privacy for outsourced data in the multi-party setting

Optimal gossip with direct addressing

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties

Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems

Spanners and sparsifiers in dynamic streams

Fast and unconditionally secure anonymous channel

Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures

On the power of the congested clique model

Distributed computing building blocks for rational agents

Brief announcement: a generic construction for nonblocking dual containers

Linear-in-delta lower bounds in the LOCAL model

Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networks

Brief announcement: concurrency-aware linearizability

Dynamic-sized nonblocking hash tables

Time versus cost tradeoffs for deterministic rendezvous in networks

Brief announcement: local approximability of minimum dominating set on planar graphs

Brief announcement: Linial's lower bound made easy

Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions

Brief announcement: Super-fast t-ruling sets

Brief announcement: almost-tight approximation distributed algorithm for minimum cut

Fast and unconditionally secure anonymous channel

Content Provider	ACM Digital Library
Author	Raykov, Pavel Ostrovsky, Rafail Garay, Juan A. Givens, Clinton
Abstract	In this paper we focus on sender-anonymous channels (a.k.a. Dining Cryptographers networks) and present a construction requiring a very low (constant) number of rounds of interaction while tolerating actively malicious behavior by some of the participants (up to less than half of them). Our construction is unconditionally secure (meaning that no bounds are placed on the computational power of the adversary), makes black-box use of a verifiable secret sharing (VSS) protocol, and is based on a special-purpose secure multiparty computation protocol implementing the method of "throwing darts;" its round complexity is essentially equal to that of the VSS protocol. In addition, since broadcast cannot be simulated in a point-to-point network when a third or more of the participants are corrupt, it is impossible to construct VSS (and, more generally, any other basic multiparty protocol) in this setting without using a "physical broadcast channel," and a recent line of research has sought to minimize the use of this expensive resource. Our anonymous channel protocol's reduction to VSS is broadcast-round-preserving, thus making the fewest (known to date) calls to the broadcast channel while running in an overall constant number of rounds. Finally, anonymous channels play an important role in the setup phase of an authentication technique known as pseudosignatures, which then may be used to simulate authenticated Byzantine agreement protocols in the information-theoretic setting. Plugging in our anonymous channel translates into a fast (and broadcast-efficient) pseudosignature construction.
Starting Page	313
Ending Page	321
Page Count	9
File Format	PDF
ISBN	9781450329446
DOI	10.1145/2611462.2611494
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-07-15
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Dc-nets Anonymous message transmission Byzantine agreement Pseudosignatures
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in