Registration Data Access Protocol (RDAP) Reverse search capabilities
draft-ietf-regext-rdap-reverse-search-03
| Document | Type | Expired Internet-Draft (regext WG) | |
|---|---|---|---|
| Authors | Mario Loffredo , Maurizio Martinelli | ||
| Last updated | 2020-05-07 (Latest revision 2019-11-04) | ||
| Replaces | draft-loffredo-regext-rdap-reverse-search | ||
| Stream | Internet Engineering Task Force (IETF) | ||
| Formats |
Expired & archived
plain text
xml
htmlized
pdfized
bibtex
|
||
| Stream | WG state | WG Document | |
| Associated WG milestone |
|
||
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Yes | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-ietf-regext-rdap-reverse-search-03.txt
Abstract
The Registration Data Access Protocol (RDAP) does not include query capabilities to find the list of domains related to a set of entities matching a given search pattern. Even if such capabilities, commonly referred as reverse search, respond to some needs not yet readily fulfilled by the current Whois protocol, they have raised concerns from two perspectives: server processing impact and data privacy. Anyway, the impact of the reverse queries on RDAP servers processing is the same as the standard searches and it can be reduced by implementing policies to deal with large result sets, while data privacy risks can be prevented by RDAP access control functionality. In the RDAP context, an entity can be associated to any defined object class. Therefore, a reverse search can be applied to other use cases than the classic domain-entity scenario. This document describes an RDAP search query extension that allows clients to request a reverse search based on the relationship between an object and the associated entities.
Authors
Mario Loffredo
Maurizio Martinelli
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)