Pi-Hole/dnsmasq
1
0
Fork 0
mirror of https://github.com/pi-hole/dnsmasq.git synced 2025-12-19 10:18:25 +00:00
Code Issues Packages Projects Releases Wiki Activity

CHANGELOG: spell-check and correct first few entries

Browse Source 
Signed-off-by: Matthias Andree <matthias.andree@gmx.de>
This commit is contained in:
Matthias Andree
2021-03-27 15:41:45 +01:00
committed by Simon Kelley
parent d1640a6338
commit 2a407a76be
1 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
CHANGELOG
View File

@@ -15,10 +15,10 @@ version 2.85
to 2.84 announcing itself as 2.84rc2. to 2.84 announcing itself as 2.84rc2.
Avoid treating a --dhcp-host which has an IPv6 address Avoid treating a --dhcp-host which has an IPv6 address
as eligable for use with DHCPv4 on the grounds that it has as eligible for use with DHCPv4 on the grounds that it has
no address, and vice-versa. Thanks to Viktor Papp for no address, and vice-versa. Thanks to Viktor Papp for
spotting the problem. (This bug was fixed was back in 2.67, and spotting the problem. (This bug was fixed was back in 2.67, and
then regessed in 2.81). then regressed in 2.81).
Add --dynamic-host option: A and AAAA records which take their Add --dynamic-host option: A and AAAA records which take their
network part from the network of a local interface. Useful network part from the network of a local interface. Useful
@@ -47,7 +47,7 @@ version 2.85
understanding of the security implications. understanding of the security implications.
Note that this change changes non-existing interface, or non-local Note that this change changes non-existing interface, or non-local
source address errors from fatal to run-time. The error will be source address errors from fatal to run-time. The error will be
logged and communiction with the server not possible. logged and communication with the server not possible.
Change the method of allocation of random source ports for DNS. Change the method of allocation of random source ports for DNS.
Previously, without min-port or max-port configured, dnsmasq would Previously, without min-port or max-port configured, dnsmasq would
@@ -57,7 +57,7 @@ version 2.85
32768 to 60999 on Linux systems. This change eliminates the 32768 to 60999 on Linux systems. This change eliminates the
possibility that dnsmasq may be using a registered port > 1024 possibility that dnsmasq may be using a registered port > 1024
when a long-running daemon starts up and wishes to claim it. when a long-running daemon starts up and wishes to claim it.
This change does likely slighly reduce the number of random ports This change does likely slightly reduce the number of random ports
and therefore the protection from reply spoofing. The older and therefore the protection from reply spoofing. The older
behaviour can be restored using the min-port and max-port config behaviour can be restored using the min-port and max-port config
switches should that be a concern. switches should that be a concern.
@@ -98,13 +98,13 @@ version 2.83
Handle multiple identical near simultaneous DNS queries better. Handle multiple identical near simultaneous DNS queries better.
Previously, such queries would all be forwarded Previously, such queries would all be forwarded
independently. This is, in theory, inefficent but in practise independently. This is, in theory, inefficient but in practise
not a problem, _except_ that is means that an answer for any not a problem, _except_ that is means that an answer for any
of the forwarded queries will be accepted and cached. of the forwarded queries will be accepted and cached.
An attacker can send a query multiple times, and for each repeat, An attacker can send a query multiple times, and for each repeat,
another {port, ID} becomes capable of accepting the answer he is another {port, ID} becomes capable of accepting the answer he is
sending in the blind, to random IDs and ports. The chance of a sending in the blind, to random IDs and ports. The chance of a
succesful attack is therefore multiplied by the number of repeats successful attack is therefore multiplied by the number of repeats
of the query. The new behaviour detects repeated queries and of the query. The new behaviour detects repeated queries and
merely stores the clients sending repeats so that when the merely stores the clients sending repeats so that when the
first query completes, the answer can be sent to all the first query completes, the answer can be sent to all the