36 search results - page 4 / 8 » Improving the Security of Dual-Rail Circuits |
CTRSA
2008
Springer
13 years 9 months ago
2008
Springer
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
PET
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactivel...
DATE
1997
IEEE
13 years 11 months ago
1997
IEEE
Two major improvements, controlled fan-in and automated initial-circuit production, were made over the random generator of benchmark circuits presented at DAC'94. This is an ...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...