90 search results - page 12 / 18 » Improved Primitives for Secure Multiparty Integer Computatio... |
139
click to vote
ICISC
2004
15 years 4 months ago
2004
Randomized recoding on the exponent of an exponentiation computation into a signed-digit representation has been a well known countermeasure against some side-channel attacks. Howe...
245
click to vote
EUROPKI
2009
Springer
15 years 1 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
133
Voted
ASIACRYPT
2010
Springer
15 years 22 days ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
157
click to vote
CASES
2010
ACM
15 years 1 months ago
2010
ACM
Physical Unclonable Functions (PUFs) based on Ring Oscillators (ROs) are a promising primitive for FPGA security. However, the quality of their implementation depends on several d...
136
click to vote
AFRICACRYPT
2010
Springer
15 years 9 months ago
2010
Springer
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...