Presentation on theme: "Practical Affiliation-Hiding Authentication from Improved Polynomial Interpolation Mark Manulis, Bertram Poettering ASIACCS ‘11 Proceedings of the 6 th."— Presentation transcript:
Practical Affiliation-Hiding Authentication from Improved Polynomial Interpolation Mark Manulis, Bertram Poettering ASIACCS ‘11 Proceedings of the 6 th ACM Symposium on Information, Computer and Communications Security, March 2011, Pages 286-295, Citation: 4 Presenter: 方竣民 Date: 2012/12/03 1
Introduction Affiliation-hiding (AH) protocols are valuable for hiding identities of communicating users behind their membership of groups. Improvements advance the area of efficient polynomial interpolation in finite fields. 4
Introduction You will see : Implementing polynomial interpolation by lots of mathematical ways and their pseudocode. One optimized multi-group Affiliation-hiding protocol. 5
Index-Hiding Message Encoding 7 Indices, messages Two algorithms iEncode and iDecode
Multi-Group AH Protocol GA creates public key (n,e,g) – n is the RSA modulus – e the public exponent – g a generator of a large subgroup of GA keeps private key d Membership credential cred = Pseudonym id, is random exponent 8 t is used to generate session key.
Conclusion They heavily modified the group management and handshake algorihms to achieve considerably better performance. It showed that AH authentication in the multi- group setting, and provided appropriate performance measurements. 36