Sciweavers

38 search results - page 5 / 8
» Universally Composable Protocols with Relaxed Set-Up Assumpt...
Sort
View
EUROCRYPT
2008
Springer
13 years 10 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
CRYPTO
2011
Springer
180views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Leakage-Resilient Zero Knowledge
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
Sanjam Garg, Abhishek Jain 0002, Amit Sahai
TCC
2005
Springer
88views Cryptology» more  TCC 2005»
14 years 2 months ago
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
Definition of security under the framework of Environmental Security (a.k.a Network-Aware Security or Universally Composable Security) typically requires “extractability” of t...
Manoj Prabhakaran, Amit Sahai
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
14 years 7 days ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
CTRSA
2011
Springer
189views Cryptology» more  CTRSA 2011»
13 years 2 days ago
Ideal Key Derivation and Encryption in Simulation-Based Security
Abstract. Many real-world protocols, such as SSL/TLS, SSH, IPsec, IEEE 802.11i, DNSSEC, and Kerberos, derive new keys from other keys. To be able to analyze such protocols in a com...
Ralf Küsters, Max Tuengerthal