scholarly journals More efficient, provably-secure direct anonymous attestation from lattices

2019 ◽  
Vol 99 ◽  
pp. 425-458 ◽  
Author(s):  
Nada El Kassem ◽  
Liqun Chen ◽  
Rachid El Bansarkhani ◽  
Ali El Kaafarani ◽  
Jan Camenisch ◽  
...  
Keyword(s):  
Direct Anonymous Attestation ◽  
Provably Secure

Anonymity and rewards in peer rating systems

2021 ◽  
pp. 1-57
Author(s):  
Lydia Garms ◽  
Siaw-Lynn Ng ◽  
Elizabeth A. Quaglia ◽  
Giulia Traverso
Keyword(s):  
Security Requirements ◽  
Rating System ◽  
Rating Systems ◽  
Peer Rating ◽  
Ring Signatures ◽  
Direct Anonymous Attestation ◽  
Security Properties ◽  
Provably Secure

When peers rate each other, they may rate inaccurately to boost their own reputation or unfairly lower another’s. This could be mitigated by having a reputation server incentivise accurate ratings with a reward. However, assigning rewards becomes challenging when ratings are anonymous, since the reputation server cannot tell which peers to reward for rating accurately. To address this, we propose an anonymous peer rating system in which users can be rewarded for accurate ratings, and we formally define its model and security requirements. In our system ratings are rewarded in batches, so that users claiming their rewards only reveal they authored one in this batch of ratings. To ensure the anonymity set of rewarded users is not reduced, we also split the reputation server into two entities, the Rewarder, who knows which ratings are rewarded, and the Reputation Holder, who knows which users were rewarded. We give a provably secure construction satisfying all the security properties required. For our construction we use a modification of a Direct Anonymous Attestation scheme to ensure that peers can prove their own reputation when rating others, and that multiple feedback on the same subject can be detected. We then use Linkable Ring Signatures to enable peers to be rewarded for their accurate ratings, while still ensuring that ratings are anonymous. Our work results in a system which allows accurate ratings to be rewarded, whilst still providing anonymity of ratings with respect to the central entities managing the system.

A Direct Anonymous Attestation Scheme in Multi-Domain Environment

2009 ◽  
Vol 31 (7) ◽  
pp. 1122-1130 ◽  
Author(s):  
Xiao-Feng CHEN ◽  
Deng-Guo FENG
Keyword(s):  
Direct Anonymous Attestation

Direct Anonymous Attestation With Optimal TPM Signing Efficiency

2021 ◽  
Vol 16 ◽  
pp. 2260-2275
Author(s):  
Kang Yang ◽  
Liqun Chen ◽  
Zhenfeng Zhang ◽  
Christopher J. P. Newton ◽  
Bo Yang ◽  
...  
Keyword(s):  
Direct Anonymous Attestation

scholarly journals A secure and highly efficient first-order masking scheme for AES linear operations

Cybersecurity ◽  
2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Jingdian Ming ◽  
Yongbin Zhou ◽  
Huizhong Li ◽  
Qian Zhang
Keyword(s):  
Cost Reduction ◽  
Provable Security ◽  
State Of The Art ◽  
Side Channel ◽  
First Order ◽  
Highly Efficient ◽  
Non Linear ◽  
Device Independence ◽  
Practical Implications ◽  
Provably Secure

AbstractDue to its provable security and remarkable device-independence, masking has been widely accepted as a noteworthy algorithmic-level countermeasure against side-channel attacks. However, relatively high cost of masking severely limits its applicability. Considering the high tackling complexity of non-linear operations, most masked AES implementations focus on the security and cost reduction of masked S-boxes. In this paper, we focus on linear operations, which seems to be underestimated, on the contrary. Specifically, we discover some security flaws and redundant processes in popular first-order masked AES linear operations, and pinpoint the underlying root causes. Then we propose a provably secure and highly efficient masking scheme for AES linear operations. In order to show its practical implications, we replace the linear operations of state-of-the-art first-order AES masking schemes with our proposal, while keeping their original non-linear operations unchanged. We implement four newly combined masking schemes on an Intel Core i7-4790 CPU, and the results show they are roughly 20% faster than those original ones. Then we select one masked implementation named RSMv2 due to its popularity, and investigate its security and efficiency on an AVR ATMega163 processor and four different FPGA devices. The results show that no exploitable first-order side-channel leakages are detected. Moreover, compared with original masked AES implementations, our combined approach is nearly 25% faster on the AVR processor, and at least 70% more efficient on four FPGA devices.

scholarly journals Provably secure server-aided verification signatures

2011 ◽  
Vol 61 (7) ◽  
pp. 1705-1723 ◽  
Author(s):  
Wei Wu ◽  
Yi Mu ◽  
Willy Susilo ◽  
Xinyi Huang
Keyword(s):  
Secure Server ◽  
Provably Secure
Sign in / Sign up

Export Citation Format

Share Document