Sciweavers

977 search results - page 66 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
ACISP
1999
Springer
14 years 1 months ago
Changing Thresholds in the Absence of Secure Channels
The ways the threshold parameter can be modified after the setup of a secret sharing scheme is the main theme of this work. The considerations are limited to the case when there ...
Keith M. Martin, Josef Pieprzyk, Reihaneh Safavi-N...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
Secured Greedy Perimeter Stateless Routing for Wireless Sensor Networks
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
P. Samundiswary, D. Sathian, P. Dananjayan
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 8 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
IACR
2011
113views more  IACR 2011»
12 years 8 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose
ICDE
2005
IEEE
100views Database» more  ICDE 2005»
14 years 10 months ago
Configurable Security Protocols for Multi-party Data Analysis with Malicious Participants
Standard multi-party computation models assume semi-honest behavior, where the majority of participants implement protocols according to specification, an assumption not always pl...
Bradley Malin, Edoardo Airoldi, Samuel Edoho-Eket,...