Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Adkins

dblp:21/6466 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3Systems, architecture and hardware · 1Security and privacy · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
4 papers
Wireless networking · 41% Routing and switching · 40% Internet architecture and protocols · 19%
Network and information security
2 papers
Network security · 72% Cryptographic primitives and cryptanalysis · 28%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%

Topics — the 9 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › cognitive radio › rendezvous
communication rendezvous
0.122004
Internet indirection infrastructure · IEEE/ACM Trans. Netw. 2004
Internet indirection infrastructure · SIGCOMM 2002
Distributed systems › peer-to-peer systems
overlay networks
0.122004
Internet indirection infrastructure · IEEE/ACM Trans. Netw. 2004
Internet indirection infrastructure · SIGCOMM 2002
Routing and switching › routing
secure routing
0.112008
Securing user-controlled routing infrastructures · IEEE/ACM Trans. Netw. 2008
Cryptographic primitives and cryptanalysis › cryptanalysis
attack analysis
0.012004
Brief announcement: towards a secure indirection infrastructure · PODC 2004
Network security › attack strategy
denial-of-service attack
0.012004
Brief announcement: towards a secure indirection infrastructure · PODC 2004
Distributed systems › peer-to-peer systems
distributed hash table
0.012002
Internet indirection infrastructure · SIGCOMM 2002
Internet architecture and protocols
multicast
0.022004
Internet indirection infrastructure · IEEE/ACM Trans. Netw. 2004
Internet indirection infrastructure · SIGCOMM 2002
Network security
routing security
0.012008
Securing user-controlled routing infrastructures · IEEE/ACM Trans. Netw. 2008
Internet architecture and protocols
overlay networks
0.012004
Brief announcement: towards a secure indirection infrastructure · PODC 2004

Methods — techniques the papers use, named apart from their topics

distributed hash table · 0.1cryptographic forwarding constraints · 0.1challenge-based mechanisms · 0.1overlay design · 0.1chord lookup protocol · 0.1
YearPublicationVenuePosition
2020 Encrypted Blockchain Databases
abstract
Blockchain databases are storage systems that combine properties of blockchains and databases like decentralization, tamperproofness, low query latency and support for complex queries. Blockchain databases are an emerging and important class of blockchain technology that is critical to the development of non-trivial smart contracts, distributed applications and decentralized marketplaces.
Daniel Adkins, Archita Agarwal, Seny Kamara, Tarik Moataz
AFT1
2008 Securing user-controlled routing infrastructures
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
IEEE/ACM Trans. Netw.2
2004 Brief announcement: towards a secure indirection infrastructure
abstract
Designing a flexible, yet secure communication infrastructure has long been an elusive goal. Most of the proposals that seek to address the problem of flexibility have opened up the system for new forms of attacks. In this paper, we consider one particular proposal, i3 [2], a flexible indirection infrastructure that provides natural support for a multitude of communication primitives such as multicast, anycast and mobility. We systematically identify the attacks on i3, and propose techniques that address the security problems without sacrificing the flexibility that i3 offers. Our techniques, ranging from cryptographically constraining the forwarding entries to challenge-based mechanisms for inserting forwarding entries, while being simple, both conceptually and to implement, make most of the attacks provably hard. We believe that this paper represents an important step towards designing communication infrastructures that are both secure and flexible.
Karthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica
PODC2
2004 Internet indirection infrastructure
abstract
Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this paper proposes a general, overlay-based Internet Indirection Infrastructure (i3) that offers a rendezvous-based communication abstraction. Instead of explicitly sending a packet to a destination, each packet is associated with an identifier; this identifier is then used by the receiver to obtain delivery of the packet. This level of indirection decouples the act of sending from the act of receiving, and allows i3 to efficiently support a wide variety of fundamental communication services. To demonstrate the feasibility of this approach, we have designed and built a prototype based on the Chord lookup protocol.
Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana
IEEE/ACM Trans. Netw.2
2002 Internet indirection infrastructure
abstract
Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this paper proposes an overlay-based Internet Indirection Infrastructure ( I3) that offers a rendezvous-based communication abstraction. Instead of explicitly sending a packet to a destination, each packet is associated with an identifier; this identifier is then used by the receiver to obtain delivery of the packet. This level of indirection decouples the act of sending from the act of receiving, and allows I3 to efficiently support a wide variety of fundamental communication services. To demonstrate the feasibility of this approach, we have designed and built a prototype based on the Chord lookup protocol.
Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana
SIGCOMM2