Sciweavers

310 search results - page 59 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 11 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
ENTCS
2008
110views more  ENTCS 2008»
13 years 11 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
CIKM
2006
Springer
14 years 2 months ago
Privacy preserving sequential pattern mining in distributed databases
Research in the areas of privacy preserving techniques in databases and subsequently in privacy enhancement technologies have witnessed an explosive growth-spurt in recent years. ...
Vishal Kapoor, Pascal Poncelet, François Tr...
ICMCS
2006
IEEE
116views Multimedia» more  ICMCS 2006»
14 years 4 months ago
SIKAS: A Scalable Distributed Key Management Scheme for Dynamic Collaborative Groups
The increasing popularity of distributed and collaborative applications prompts the need for secure communication in collaborative groups. Some distributed collaborative key manag...
Jiang Zhang, Jian-Guang Luo, Bin Li, Shiqiang Yang
ASIACRYPT
2010
Springer
13 years 8 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