Sciweavers

6 search results - page 1 / 2
» Practical Zero-Knowledge Proofs for Circuit Evaluation
Sort
View
IMA
2009
Springer
149views Cryptology» more  IMA 2009»
14 years 5 days ago
Practical Zero-Knowledge Proofs for Circuit Evaluation
Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi
IACR
2011
97views more  IACR 2011»
12 years 5 months ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
13 years 9 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
IACR
2011
132views more  IACR 2011»
12 years 5 months ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...
JPDC
2007
100views more  JPDC 2007»
13 years 5 months ago
Deadlock-free connection-based adaptive routing with dynamic virtual circuits
Virtual circuits can reduce routing overheads with irregular topologies and provide support for a mix of quality of service (QOS) requirements. Information about network loads and...
Yoshio Turner, Yuval Tamir