3 citations · 3 across the 2 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2021
Compactness of Hashing Modes and Efficiency beyond Merkle Tree
Elena Andreeva, Rishiraj Bhattacharyya, Arnab Roy
We revisit the classical problem of designing optimally efficient cryptographically secure hash functions. Hash functions are traditionally designed via applying modes of operation…
cs.CR2017★ 3 cited
Multiparty Routing: Secure Routing for Mixnets
Fatemeh Shirazi, Elena Andreeva, Markulf Kohlweiss +1
Anonymous communication networks are important building blocks for online privacy protection. One approach to achieve anonymity is to relay messages through multiple routers, where…