Sciweavers

234 search results - page 40 / 47
» Proof Nets and the Identity of Proofs
Sort
View
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
15 years 4 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
SAGA
2007
Springer
15 years 4 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
CRYPTO
2005
Springer
120views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS), providing new de...
Michel Abdalla, Mihir Bellare, Dario Catalano, Eik...
CRYPTO
2005
Springer
149views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Authenticating Pervasive Devices with Human Protocols
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
Ari Juels, Stephen A. Weis
COLT
2000
Springer
15 years 2 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...