Sciweavers

915 search results - page 20 / 183
» Proof labeling schemes
Sort
View
CSFW
2012
IEEE
11 years 10 months ago
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
Valerio Genovese, Deepak Garg, Daniele Rispoli
EUROCRYPT
2010
Springer
14 years 20 days ago
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
Rafael Pass, Hoeteck Wee
JCP
2010
100views more  JCP 2010»
13 years 6 months ago
Provable Secure Generalized Signcryption
Generalized signcryption which proposed by Han is a new cryptographic primitive which can work as an encryption scheme, a signature scheme or a signcryption scheme [5]. However,the...
Xu An Wang, Xiaoyuan Yang, Jindan Zhang
NIPS
2004
13 years 9 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
MMM
2007
Springer
123views Multimedia» more  MMM 2007»
14 years 2 months ago
Tamper Proofing 3D Motion Data Streams
This paper presents a fragile watermarking technique to tamper proof (Mocap) motion capture data. The technique visualizes 3D Mocap data as a series of cluster of points. Watermark...
Parag Agarwal, Balakrishnan Prabhakaran