| Nov. 27, 2023, 2:13 p.m. |
Added
35
|
{"external_links": []}
|
|
| Nov. 20, 2023, 2:03 p.m. |
Added
35
|
{"external_links": []}
|
|
| Nov. 13, 2023, 1:34 p.m. |
Added
35
|
{"external_links": []}
|
|
| Nov. 6, 2023, 1:31 p.m. |
Added
35
|
{"external_links": []}
|
|
| Aug. 14, 2023, 1:31 p.m. |
Added
35
|
{"external_links": []}
|
|
| Aug. 7, 2023, 1:32 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 31, 2023, 1:34 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 24, 2023, 1:36 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 17, 2023, 1:35 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 10, 2023, 1:26 p.m. |
Added
35
|
{"external_links": []}
|
|
| July 3, 2023, 1:27 p.m. |
Added
35
|
{"external_links": []}
|
|
| June 26, 2023, 1:26 p.m. |
Added
35
|
{"external_links": []}
|
|
| June 19, 2023, 1:27 p.m. |
Added
35
|
{"external_links": []}
|
|
| June 12, 2023, 1:29 p.m. |
Added
35
|
{"external_links": []}
|
|
| June 5, 2023, 1:34 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 29, 2023, 1:28 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 22, 2023, 1:29 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 15, 2023, 1:32 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 8, 2023, 1:37 p.m. |
Added
35
|
{"external_links": []}
|
|
| May 1, 2023, 1:28 p.m. |
Added
35
|
{"external_links": []}
|
|
| April 24, 2023, 1:35 p.m. |
Added
35
|
{"external_links": []}
|
|
| April 17, 2023, 1:28 p.m. |
Added
35
|
{"external_links": []}
|
|
| April 10, 2023, 1:25 p.m. |
Added
35
|
{"external_links": []}
|
|
| April 3, 2023, 1:26 p.m. |
Added
35
|
{"external_links": []}
|
|
| Jan. 28, 2023, 11:09 a.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 29846, "fields": {"project": 7065, "organisation": 2, "amount": 202913, "start_date": "2016-03-31", "end_date": "2019-03-31", "raw_data": 49401}}]
|
|
| Jan. 28, 2023, 10:52 a.m. |
Added
35
|
{"external_links": []}
|
|
| April 11, 2022, 3:48 a.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 21980, "fields": {"project": 7065, "organisation": 2, "amount": 202913, "start_date": "2016-03-31", "end_date": "2019-03-31", "raw_data": 32561}}]
|
|
| April 11, 2022, 3:48 a.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 82875, "fields": {"project": 7065, "organisation": 2436, "role": "PP_ORG"}}]
|
|
| April 11, 2022, 3:48 a.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 82874, "fields": {"project": 7065, "organisation": 8711, "role": "COLLAB_ORG"}}]
|
|
| April 11, 2022, 3:48 a.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 82873, "fields": {"project": 7065, "organisation": 2436, "role": "COLLAB_ORG"}}]
|
|
| April 11, 2022, 3:48 a.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 82872, "fields": {"project": 7065, "organisation": 44, "role": "LEAD_ORG"}}]
|
|
| April 11, 2022, 3:48 a.m. |
Created
40
|
[{"model": "core.projectperson", "pk": 51394, "fields": {"project": 7065, "person": 9849, "role": "PI_PER"}}]
|
|
| April 11, 2022, 1:48 a.m. |
Updated
35
|
{"title": ["", "Security and Privacy in Smart Grid Systems: Countermeasure and Formal Verification"], "description": ["", "\nIn many distributed computing contexts, a need arises for two mutually-distrusting parties to undertake a joint calculation, often without the disclosure of the unprocessed data from one or both sides to the other. Sometimes a 'trusted third party' is used for this purpose - but immediately the verification of the trustworthiness of that party becomes a challenge. The cryptographic world has addressed this through the paradigm of secure multi-party computation - and the related problem of an untrusted processor through various schemes of homomorphic encryption. These are successful in many contexts, but imply certain overheads and complexities. \n\nWe propose a different model, wherein the technologies of Trusted Computing are used to create an assured Trustworthy Remote Entity (TRE): this also enables us to develop duplex communications, which are seldom considered in the approaches described above. The main part of this project is devoted to developing and verifying a TRE-based solution for the substantial and far-reaching challenges of security and privacy in smart power grids: later in the project we consider the generalization of the approach to other similar problems, such as those in dynamic location-based road pricing. The 'big idea' is that the user can be signed up with a TRE, and have a high degree of confidence that their data (e.g. the information on how much electricity is being used right now) is not going to get in to the hands of someone who might use it against them (e.g. to work out when the home is unoccupied) - but the power company can also have from their side confidence that the data they receive is coming from one of their customers. If they need to reduce demand - in the extreme case by, say, remotely switching off somone's air conditioning unit fora time - they can send a signal back, confident that it will go to the right user, without knowing which customer that is.\n\nThis approach can be generalised to many other situations: for example, the TRE could help to calculate a price for you to drive on a particular road at a particular time, without disclosing your movements to the transport authority. It could also pass back personalized (but anonymous) instructions on how to find a better route at the time.\n\n"], "extra_text": ["", "\n\nPotential Impact:\nWhen these research objectives are achieved, we will be able to provide service providers with a building-block solution which enables them cheaply and easily to deliver highly-assured centralized processing of personal data, with strong guarantees that the privacy of the individuals involved cannot be compromised. This is good for those businesses (since they seldom want the liability of processing personal data, but want to be able to offer customized services) as well as being good for individual consumers and society at large, buy keeping each person in control of their own personal data.\n\nWe expect this approach to open up many new opportunities in research - for researchers and companies to explore different scenarios in which such a capability will be useful. It will also help those who design tools for system verification to hone those tools against realistic scenarios: many practical deployments are difficult to verify because they are too large and complex. Our scenario abstracts away one key component and reduces it to a tractable verification task.\n\n\n"], "status": ["", "Closed"]}
|
|
| April 11, 2022, 1:48 a.m. |
Added
35
|
{"external_links": [25612]}
|
|
| April 11, 2022, 1:48 a.m. |
Created
35
|
[{"model": "core.project", "pk": 7065, "fields": {"owner": null, "is_locked": false, "coped_id": "d737e7cb-bcda-4afa-a68b-a33979e51cfb", "title": "", "description": "", "extra_text": "", "status": "", "start": null, "end": null, "raw_data": 32547, "created": "2022-04-11T01:44:37.007Z", "modified": "2022-04-11T01:44:37.008Z", "external_links": []}}]
|
|