Sciweavers

232 search results - page 10 / 47
» Verifying persistent security properties
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 4 days ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
CSFW
2006
IEEE
14 years 2 months ago
Privacy APIs: Access Control Techniques to Analyze and Verify Legal Privacy Policies
There is a growing interest in establishing rules to regulate the privacy of citizens in the treatment of sensitive personal data such as medical and financial records. Such rule...
Michael J. May, Carl A. Gunter, Insup Lee
CSI
2007
54views more  CSI 2007»
13 years 8 months ago
A practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed...
Jian-jie Zhao, Jianzhong Zhang 0005, Rong Zhao
EUROCRYPT
2007
Springer
14 years 14 days ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
SEFM
2007
IEEE
14 years 2 months ago
Verifying the Mondex Case Study
The Mondex Case study is still the most substantial contribution to the Grand Challenge repository. It has been the target of a number of formal verification efforts. Those effor...
Peter H. Schmitt, Isabel Tonin