Sciweavers

370 search results - page 20 / 74
» Limits of Constructive Security Proofs
Sort
View
IJNSEC
2007
156views more  IJNSEC 2007»
13 years 8 months ago
Another Look at PMAC
We can view an existing Message Authentication Code (MAC) as a Carter-Wegman MAC in spite of the fact it may not have been designed as one. This will make the analysis easier than...
Dayin Wang, Dongdai Lin, Wenling Wu
PKC
2004
Springer
112views Cryptology» more  PKC 2004»
14 years 1 months ago
Identity-Based Threshold Decryption
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
Joonsang Baek, Yuliang Zheng
CCS
2004
ACM
14 years 1 months ago
Formally verifying information flow type systems for concurrent and thread systems
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...
Gilles Barthe, Leonor Prensa Nieto
PAIRING
2009
Springer
119views Cryptology» more  PAIRING 2009»
14 years 2 months ago
Compact E-Cash and Simulatable VRFs Revisited
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, A...
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
14 years 2 months ago
Restricted Queries over an Encrypted Index with Applications to Regulatory Compliance
Compliance storage is an increasingly important area for businesses faced with a myriad of new document retention regulations. Today, businesses have turned to Write-One Read Many ...
Nikita Borisov, Soumyadeb Mitra