|
|
|
@ -1,14 +1,10 @@
|
|
|
|
|
import asyncio
|
|
|
|
|
|
|
|
|
|
import msgpack
|
|
|
|
|
import pytest
|
|
|
|
|
from constant_sorrow import constants, default_constant_splitter
|
|
|
|
|
from kademlia.utils import digest
|
|
|
|
|
|
|
|
|
|
from nucypher.crypto.api import keccak_digest
|
|
|
|
|
from nucypher.crypto.kits import UmbralMessageKit
|
|
|
|
|
from nucypher.policy.models import TreasureMap
|
|
|
|
|
from tests.utilities import TEST_EVENT_LOOP, MockRestMiddleware
|
|
|
|
|
from tests.utilities import MockRestMiddleware
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
@pytest.mark.usefixtures('testerchain')
|
|
|
|
@ -54,7 +50,6 @@ def test_vladimir_illegal_interface_key_does_not_propagate(ursulas):
|
|
|
|
|
|
|
|
|
|
@pytest.mark.skip("What do we want this test to do now?")
|
|
|
|
|
def test_alice_finds_ursula_via_rest(alice, ursulas):
|
|
|
|
|
|
|
|
|
|
# Imagine alice knows of nobody.
|
|
|
|
|
alice._known_nodes = {}
|
|
|
|
|
|
|
|
|
@ -68,15 +63,15 @@ def test_alice_finds_ursula_via_rest(alice, ursulas):
|
|
|
|
|
assert ursula.stamp.as_umbral_pubkey() in new_nodes
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def test_alice_creates_policy_group_with_correct_hrac(idle_federated_policy):
|
|
|
|
|
def test_alice_creates_policy_with_correct_hrac(idle_federated_policy):
|
|
|
|
|
"""
|
|
|
|
|
Alice creates a PolicyGroup. It has the proper HRAC, unique per her, Bob, and the uri (resource_id).
|
|
|
|
|
Alice creates a Policy. It has the proper HRAC, unique per her, Bob, and the uri (resource_id).
|
|
|
|
|
"""
|
|
|
|
|
alice = idle_federated_policy.alice
|
|
|
|
|
bob = idle_federated_policy.bob
|
|
|
|
|
|
|
|
|
|
assert idle_federated_policy.hrac() == keccak_digest(
|
|
|
|
|
bytes(alice.stamp) + bytes(bob.stamp) + alice.__resource_id)
|
|
|
|
|
bytes(alice.stamp) + bytes(bob.stamp) + idle_federated_policy.label)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def test_alice_sets_treasure_map(enacted_federated_policy, ursulas):
|
|
|
|
@ -86,9 +81,9 @@ def test_alice_sets_treasure_map(enacted_federated_policy, ursulas):
|
|
|
|
|
networky_stuff = MockRestMiddleware()
|
|
|
|
|
enacted_federated_policy.publish_treasure_map(network_middleare=networky_stuff)
|
|
|
|
|
|
|
|
|
|
treasure_map_as_set_on_network = list(ursulas)[0].dht_server.storage[
|
|
|
|
|
digest(enacted_federated_policy.treasure_map_dht_key())]
|
|
|
|
|
assert treasure_map_as_set_on_network == constants.BYTESTRING_IS_TREASURE_MAP + bytes(enacted_federated_policy.treasure_map)
|
|
|
|
|
treasure_map_as_set_on_network = list(ursulas)[0].treasure_maps[
|
|
|
|
|
digest(enacted_federated_policy.treasure_map.public_id())]
|
|
|
|
|
assert treasure_map_as_set_on_network == enacted_federated_policy.treasure_map
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
@pytest.mark.skip("Needs cleanup.")
|
|
|
|
@ -104,8 +99,8 @@ def test_treasure_map_with_bad_id_does_not_propagate(idle_federated_policy, ursu
|
|
|
|
|
message_kit, signature = alice.encrypt_for(bob, treasure_map.packed_payload())
|
|
|
|
|
|
|
|
|
|
alice.network_middleware.put_treasure_map_on_node(node=ursulas[1],
|
|
|
|
|
map_id=illegal_policygroup_id,
|
|
|
|
|
map_payload=message_kit.to_bytes())
|
|
|
|
|
map_id=illegal_policygroup_id,
|
|
|
|
|
map_payload=message_kit.to_bytes())
|
|
|
|
|
|
|
|
|
|
# setter = alice.server.set(illegal_policygroup_id, message_kit.to_bytes())
|
|
|
|
|
# _set_event = TEST_EVENT_LOOP.run_until_complete(setter)
|
|
|
|
@ -119,45 +114,37 @@ def test_treasure_map_stored_by_ursula_is_the_correct_one_for_bob(alice, bob, ur
|
|
|
|
|
"""
|
|
|
|
|
The TreasureMap given by Alice to Ursula is the correct one for Bob; he can decrypt and read it.
|
|
|
|
|
"""
|
|
|
|
|
treasure_map_as_set_on_network = list(ursulas)[0].dht_server.storage[
|
|
|
|
|
digest(enacted_federated_policy.treasure_map_dht_key())]
|
|
|
|
|
treasure_map_as_set_on_network = list(ursulas)[0].treasure_maps[
|
|
|
|
|
digest(enacted_federated_policy.treasure_map.public_id())]
|
|
|
|
|
|
|
|
|
|
header, payload = default_constant_splitter(treasure_map_as_set_on_networka)
|
|
|
|
|
hrac_by_bob = bob.construct_policy_hrac(alice.stamp, enacted_federated_policy.label)
|
|
|
|
|
assert enacted_federated_policy.hrac() == hrac_by_bob
|
|
|
|
|
|
|
|
|
|
treasure_map = TreasureMap.from_bytes(payload)
|
|
|
|
|
|
|
|
|
|
assert header == constants.BYTESTRING_IS_TREASURE_MAP
|
|
|
|
|
|
|
|
|
|
tmap_message_kit = UmbralMessageKit.from_bytes(encrypted_treasure_map)
|
|
|
|
|
verified, treasure_map_as_decrypted_by_bob = bob.verify_from(alice,
|
|
|
|
|
tmap_message_kit,
|
|
|
|
|
decrypt=True)
|
|
|
|
|
|
|
|
|
|
assert treasure_map_as_decrypted_by_bob == enacted_federated_policy.treasure_map.packed_payload()
|
|
|
|
|
assert verified is True
|
|
|
|
|
map_id_by_bob = bob.construct_map_id(alice.stamp, enacted_federated_policy.label)
|
|
|
|
|
assert map_id_by_bob == treasure_map_as_set_on_network.public_id()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
@pytest.mark.usefixtures("treasure_map_is_set_on_dht")
|
|
|
|
|
def test_bob_can_retreive_the_treasure_map_and_decrypt_it(enacted_federated_policy, ursulas):
|
|
|
|
|
"""
|
|
|
|
|
Above, we showed that the TreasureMap saved on the network is the correct one for Bob. Here, we show
|
|
|
|
|
that Bob can retrieve it with only the information about which he is privy pursuant to the PolicyGroup.
|
|
|
|
|
"""
|
|
|
|
|
bob = enacted_federated_policy.bob
|
|
|
|
|
_ = MockRestMiddleware()
|
|
|
|
|
|
|
|
|
|
# Of course, in the real world, Bob has sufficient information to reconstitute a PolicyGroup, gleaned, we presume,
|
|
|
|
|
# through a side-channel with Alice.
|
|
|
|
|
|
|
|
|
|
# If Bob doesn't know about any Ursulas, he can't find the TreasureMap via the REST swarm:
|
|
|
|
|
with pytest.raises(bob.NotEnoughUrsulas):
|
|
|
|
|
treasure_map_from_wire = bob.get_treasure_map(enacted_federated_policy.alice.stamp, enacted_federated_policy.hrac())
|
|
|
|
|
treasure_map_from_wire = bob.get_treasure_map(enacted_federated_policy.alice.stamp,
|
|
|
|
|
enacted_federated_policy.label)
|
|
|
|
|
|
|
|
|
|
# Let's imagine he has learned about some - say, from the blockchain.
|
|
|
|
|
bob._known_nodes = {u.interface_info_with_metadata(): u for u in ursulas}
|
|
|
|
|
bob._known_nodes = {u.canonical_public_address: u for u in ursulas}
|
|
|
|
|
|
|
|
|
|
# Now try.
|
|
|
|
|
treasure_map_from_wire = bob.get_treasure_map(enacted_federated_policy.alice.stamp, enacted_federated_policy.hrac())
|
|
|
|
|
treasure_map_from_wire = bob.get_treasure_map(enacted_federated_policy.alice.stamp,
|
|
|
|
|
enacted_federated_policy.label)
|
|
|
|
|
|
|
|
|
|
assert enacted_federated_policy.treasure_map == treasure_map_from_wire
|
|
|
|
|
|
|
|
|
@ -166,11 +153,5 @@ def test_treaure_map_is_legit(enacted_federated_policy):
|
|
|
|
|
"""
|
|
|
|
|
Sure, the TreasureMap can get to Bob, but we also need to know that each Ursula in the TreasureMap is on the network.
|
|
|
|
|
"""
|
|
|
|
|
alice = enacted_federated_policy.alice
|
|
|
|
|
for ursula_interface_id in enacted_federated_policy.treasure_map:
|
|
|
|
|
value = alice.server.get_now(ursula_interface_id)
|
|
|
|
|
header, signature, ursula_pubkey_sig, interface_info = dht_value_splitter(value, return_remainder=True)
|
|
|
|
|
assert header == constants.BYTESTRING_IS_URSULA_IFACE_INFO
|
|
|
|
|
port = msgpack.loads(interface_info)[1]
|
|
|
|
|
legal_ports = range(int(constants.NUMBER_OF_URSULAS_IN_NETWORK), int(constants.NUMBER_OF_URSULAS_IN_NETWORK+constants.URSULA_PORT_SEED))
|
|
|
|
|
assert port in legal_ports
|
|
|
|
|
for ursula_address in enacted_federated_policy.treasure_map:
|
|
|
|
|
assert ursula_address in enacted_federated_policy.bob._known_nodes
|
|
|
|
|