Sciweavers

86 search results - page 2 / 18
» Impossibility Results for Secret Establishment
Sort
View
EUROCRYPT
2004
Springer
15 years 2 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
CCS
2006
ACM
15 years 1 months ago
An efficient key establishment scheme for secure aggregating sensor networks
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up s...
Erik-Oliver Blaß, Martina Zitterbart
CN
2004
163views more  CN 2004»
14 years 9 months ago
Highly reliable trust establishment scheme in ad hoc networks
Securing ad hoc networks in a fully self-organized way is effective and light-weight, but fails to accomplish trust initialization in many trust deficient scenarios. To overcome t...
Kui Ren, Tieyan Li, Zhiguo Wan, Feng Bao, Robert H...
EUROCRYPT
2005
Springer
15 years 2 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
ASIACRYPT
2010
Springer
14 years 6 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
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...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan