Filters








53 Hits in 1.5 sec

Efficient Sanitizable Signatures Without Random Oracles [chapter]

Russell W. F. Lai, Tao Zhang, Sherman S. M. Chow, Dominique Schröder
2016 Lecture Notes in Computer Science  
Re-randomizable Tag + SignaturesSanitizable Signatures Construction I Overview Basic Construction from Re-randomizable Tagging σ = (σ FIX , τ ) m FIX = (FIX ADM (m), pk San ) σ FIX : Signature  ...  Signatures besides Signing?  ... 
doi:10.1007/978-3-319-45744-4_18 fatcat:vjy4j5qy2ffxfozbhyg54cuvxy

Trapdoor Sanitizable Signatures Made Easy [chapter]

Dae Hyun Yum, Jae Woo Seo, Pil Joong Lee
2010 Lecture Notes in Computer Science  
imply trapdoor sanitizable signatures.  ...  We present a generic construction of trapdoor sanitizable signatures from ordinary signature schemes.  ...  We present a very simple and efficient approach to building trapdoor sanitizable signature schemes from ordinary signature schemes.  ... 
doi:10.1007/978-3-642-13708-2_4 fatcat:oc63ijwlk5ekroob65wnxrem3u

Sanitizable Signatures [chapter]

Giuseppe Ateniese, Daniel H. Chou, Breno de Medeiros, Gene Tsudik
2005 Lecture Notes in Computer Science  
A sanitizable signature allows authorized semi-trusted censors to modify -in a limited and controlled fashion -parts of a signed message without interacting with the original signer.  ...  We introduce the notion of sanitizable signatures that offer many attractive security features for certain current and emerging applications.  ...  Our sanitizable signature schemes are practical and efficient.  ... 
doi:10.1007/11555827_10 fatcat:sbl7s5zimvcdhkhntipvemv6p4

Security of Sanitizable Signatures Revisited [chapter]

Christina Brzuska, Marc Fischlin, Tobias Freudenreich, Anja Lehmann, Marcus Page, Jakob Schelbert, Dominique Schröder, Florian Volk
2009 Lecture Notes in Computer Science  
Here we revisit the security requirements for sanitizable signatures and, for the first time, present a comprehensive formal treatment.  ...  Sanitizable signature schemes, as defined by Ateniese et al. (ESORICS 2005), allow a signer to partly delegate signing rights to another party, called the sanitizer.  ...  In the full version we show that such chameleon hashes exist under the RSA assumption in the random oracle model: Definition 8 (Collision-Resistance under Random-Tagging Attacks).  ... 
doi:10.1007/978-3-642-00468-1_18 fatcat:pzgg3wu3unbjbdx2n7x7hdkll4

Protecting privacy by sanitizing personal data

Sébastien Canard, Roch Lescuyer
2013 Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS '13  
We also provide a concrete construction based on standard assumptions and secure in the random oracle model.  ...  Unfortunately, existing sanitizable signatures can not directly be used for this purpose. We thus seek for generic conditions on them to be used as anonymous credentials.  ...  We are also grateful to Amandine Jambert for helpful discussions on sanitizable signatures, to Sherman Chow for his help on this final version and to anonymous referees for their valuable comments.  ... 
doi:10.1145/2484313.2484363 dblp:conf/ccs/CanardL13 fatcat:av5sdmff4bcdzgdupzrmrxplve

Unlinkability of Sanitizable Signatures [chapter]

Christina Brzuska, Marc Fischlin, Anja Lehmann, Dominique Schröder
2010 Lecture Notes in Computer Science  
Here we discuss that a sixth property of sanitizable signature schemes may be desirable: unlinkability.  ...  Sanitizable signatures allow a designated party, called the sanitizer, to modify parts of signed data such that the immutable parts can still be verified with respect to the original signer.  ...  The adversary is also allowed to query a left-or-right oracle LoRSanit which is initialized with a secret random bit b.  ... 
doi:10.1007/978-3-642-13013-7_26 fatcat:tm72x4fkyzcwbc6bwbxizzsoae

Sequential Bitwise Sanitizable Signature Schemes

Goichiro HANAOKA, Shoichi HIROSE, Atsuko MIYAJI, Kunihiko MIYAZAKI, Bagus SANTOSO, Peng YANG
2011 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
In this paper, we propose a solution by introducing a new concept called sequential bitwise sanitizable signature schemes, where any sequence of bits of the signed document can be made sanitizable without  ...  pre-defining them, and without increasing the length of signature.  ...  [4] presented another scheme with message overhead O(λ) under the RSA assumption without using random oracles.  ... 
doi:10.1587/transfun.e94.a.392 fatcat:ssbzwxlt4jhtxobtjt77pvrdca

Unlinkable and Strongly Accountable Sanitizable Signatures from Verifiable Ring Signatures [chapter]

Xavier Bultel, Pascal Lafourcade
2018 Lecture Notes in Computer Science  
Finally, we prove the security properties of GUSS (including strong accountability) and EVeR under the Decisional Diffie-Hellman (DDH) assumption in the random oracle model.  ...  An Unlinkable Sanitizable Signature scheme (USS) allows a sanitizer to modify some parts of a signed message in such away that nobody can link the modified signature to the original one.  ...  We also design an efficient secure VRS scheme under the DDH assumption in the random oracle model.  ... 
doi:10.1007/978-3-030-02641-7_10 fatcat:qxn5pdh5tnfpfgc4u4thyof7zy

Hierarchical Identity-Based Chameleon Hash and Its Applications [chapter]

Feng Bao, Robert H. Deng, Xuhua Ding, Junzuo Lai, Yunlei Zhao
2011 Lecture Notes in Computer Science  
a new signature on the sanitized message without interacting with the original signer.  ...  At ACNS 2008, Canard et al. introduced the notion of trapdoor sanitizable signature (TSS) based on identity-based chameleon hash (IBCH).  ...  Santizable signature allows a sanitizer to modify predetermined parts of a signed message and generate new signature on the sanitized message without interacting with the signer.  ... 
doi:10.1007/978-3-642-21554-4_12 fatcat:bhjro55asvaqxn62ihgwdwna6m

Efficient Invisible and Unlinkable Sanitizable Signatures [chapter]

Xavier Bultel, Pascal Lafourcade, Russell W. F. Lai, Giulio Malavolta, Dominique Schröder, Sri Aravinda Krishnan Thyagarajan
2019 Lecture Notes in Computer Science  
When instantiating in the generic group and random oracle model, the efficiency of our construction is comparable to that of prior constructions, while providing stronger security guarantees.  ...  First, we construct (non-accountable) invisible and unlinkable sanitizable signatures from signatures on equivalence classes and other basic primitives.  ...  Without loss of generality, assume that A makes Q 1 = poly(λ) signing oracle queries and Q 2 = poly(λ) random oracle queries for H().  ... 
doi:10.1007/978-3-030-17253-4_6 fatcat:ctfmbscn4zfljp3rl3so6ppufy

Sanitizable Signatures with Strong Transparency in the Standard Model [chapter]

Shivank Agrawal, Swarun Kumar, Amjed Shareef, C. Pandu Rangan
2010 Lecture Notes in Computer Science  
Sanitizable signatures allow a semi-trusted party to update some part of the digitally signed document without interacting with the original signer.  ...  In this paper, we have described the first efficient and provably secure sanitizable signature scheme having strong transparency under the standard model.  ...  A sanitizable signature scheme is a signature scheme which allows a designated party, called the sanitizer, to hide certain parts of the original message after the message is signed, without interacting  ... 
doi:10.1007/978-3-642-16342-5_7 fatcat:ozikzefmknhnpk3hzu3333nfoa

On Extended Sanitizable Signature Schemes [chapter]

Sébastien Canard, Amandine Jambert
2010 Lecture Notes in Computer Science  
In this paper, we give a new secure sanitizable signature scheme which is, to the best of our knowledge, the most efficient construction with such a high level of security.  ...  We also enhance the Brzuska et al. model on sanitizable signature schemes by adding new features.  ...  We also give in Section 3 a new sanitizable signature scheme without additional features which is, to the best of our knowledge, the most efficient and secure construction.  ... 
doi:10.1007/978-3-642-11925-5_13 fatcat:i77zwgz6xndlrhnj65kej4upva

Chameleon-Hashes with Dual Long-Term Trapdoors and Their Applications [chapter]

Stephan Krenn, Henrich C. Pöhls, Kai Samelin, Daniel Slamanig
2018 Lecture Notes in Computer Science  
The one-more-RSA-assumption associated to RSA is provided an inversion oracle I, which inverts any element x ∈ Z * n w.r.t. e, and a challenge oracle C, which at each call returns a random element y i  ...  This new primitive enables several new use-cases for sanitizable signatures scheme. For example, consider the following scenario, where "standard" sanitizable signatures [2] are not sufficient.  ...  .: Stronger security for sanitizable signatures. In: DPM. pp. 100-117 (2015) 49. Lai, R.W.F., Zhang, T., Chow, S.S.M., Schröder, D.: Efficient sanitizable signatures without random oracles.  ... 
doi:10.1007/978-3-319-89339-6_2 fatcat:bvkvzn4cbzebxgtpdytjjdkg4a

Practical Strongly Invisible and Strongly Accountable Sanitizable Signatures [chapter]

Michael Till Beck, Jan Camenisch, David Derler, Stephan Krenn, Henrich C. Pöhls, Kai Samelin, Daniel Slamanig
2017 Lecture Notes in Computer Science  
Sanitizable signature schemes (SSS) [3] allow for such controlled modifications of signed messages without invalidating the signature.  ...  Sanitizable signatures are a variant of digital signatures where a designated party (the sanitizer) can update admissible parts of a signed message.  ...  Correctness of Sanitizable Signature Schemes.  ... 
doi:10.1007/978-3-319-60055-0_23 fatcat:r4od3vnre5gifmln72rrek4qxm

Non-interactive Public Accountability for Sanitizable Signatures [chapter]

Christina Brzuska, Henrich C. Pöhls, Kai Samelin
2013 Lecture Notes in Computer Science  
Sanitizable signatures enable a designated party to modify signed documents in a controlled way, while the derived signature still verifies.  ...  It allows a third party to determine whether a message-signature pair was issued by the signer or the sanitizer.  ...  A sanitizable signature scheme SanSig is non-interactive publicly accountable, iff Proof = ⊥ and if for any efficient algorithm A the probability that the experiment Pubaccountability SanSig A (λ) given  ... 
doi:10.1007/978-3-642-40012-4_12 fatcat:mpxthage6zefjgnej2bvr6j6ry
« Previous Showing results 1 — 15 out of 53 results