Sciweavers

195 search results - page 11 / 39
» Security and Privacy Using One-Round Zero-Knowledge Proofs
Sort
View
EUROCRYPT
2008
Springer
15 years 1 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith
CRYPTO
2003
Springer
96views Cryptology» more  CRYPTO 2003»
15 years 5 months ago
Scalable Protocols for Authenticated Group Key Exchange
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have bee...
Jonathan Katz, Moti Yung
CCS
2009
ACM
16 years 9 days ago
Confidentiality-preserving distributed proofs of conjunctive queries
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
Adam J. Lee, Kazuhiro Minami, Nikita Borisov
ESORICS
2009
Springer
16 years 9 days ago
PCAL: Language Support for Proof-Carrying Authorization Systems
By shifting the burden of proofs to the user, a proof-carrying authorization (PCA) system can automatically enforce complex access control policies. Unfortunately, managing those p...
Avik Chaudhuri, Deepak Garg
EUROCRYPT
2012
Springer
13 years 2 months ago
Malleable Proof Systems and Applications
sion of an extended abstract published in Proceedings of Eurocrypt 2012, Springer-Verlag, 2012. Available from the IACR Cryptology ePrint Archive as Report 2012/012. Malleability ...
Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya...