Sciweavers

25 search results - page 2 / 5
» Verifying Secrets and Relative Secrecy
Sort
View
CORR
2002
Springer
122views Education» more  CORR 2002»
13 years 5 months ago
On alternative approach for verifiable secret sharing
The proposed approach works for any underlying secret sharing scheme. It is based on the concept of verification sets of participants, related to authorized set of participants. T...
Kamil Kulesza, Zbigniew Kotulski, Josef Pieprzyk
CORR
2008
Springer
105views Education» more  CORR 2008»
13 years 5 months ago
Success Exponent of Wiretapper: A Tradeoff between Secrecy and Reliability
Equivocation has been widely used as a measure of security after Shannon[10]. For an infinite system such as the wiretap channel defined in [2], equivocation is unbounded and so e...
Chung Chan
FSTTCS
2003
Springer
13 years 10 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
ICALP
2010
Springer
13 years 7 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CSFW
2012
IEEE
11 years 7 months ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...