Sciweavers

32 search results - page 4 / 7
» tcc 2007
Sort
View
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 3 months ago
Perfect NIZK with Adaptive Soundness
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
Masayuki Abe, Serge Fehr
TCC
2007
Springer
93views Cryptology» more  TCC 2007»
14 years 3 months ago
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
Abstract. We construct an intrusion-resilient symmetric-key authenticated key exchange (AKE) protocol in the bounded retrieval model. The model employs a long shared private key to...
David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke L...
TCC
2007
Springer
96views Cryptology» more  TCC 2007»
14 years 3 months ago
Securely Obfuscating Re-encryption
Abstract. We present the first positive obfuscation result for a traditional cryptographic functionality. This positive result stands in contrast to well-known negative impossibil...
Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, V...
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 3 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström